Review Question

[Xue Yang]

Hi,

I have a question about the complexity of Spectral Projection Algorithm and ITLES Algorithm. Are they both linear time? Do we need to consider the sorting time (sorting among the x, y) in ITLES Algorithm?

Thanks,

Xue

[Tim Menzies]

yes. the sorts will make the whole process O(n.log(n))

fyi: i say "near linear time" since, in practice, the algorithm
actually does scale linearly


t

> --
> You received this message because you are subscribed to the Google Groups
> "csx73" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to csx73+un...@googlegroups.com.
> For more options, visit https://groups.google.com/groups/opt_out.



--
:: there are some who call me... tim.m...@gmail.com
:: prof @ cs.ai.se.csee.wvu.usa.sol.virgo.all.nil
:: +1-304-376-2859
:: http://menzies.us (skype = menzies.tim)

<hubris>
vita= http:// goo.gl/8eNhY
pubs= http:// goo.gl/8KPKA
stats= http:// goo.gl/vggy1
wow = http:// goo.gl/2Wg9A
</hubris>