10412 search results - page 57 / 2083 » The efficiency of algorithms - misconceptions |
COLT
2008
Springer
13 years 10 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
APWEB
2010
Springer
13 years 9 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
AMC
2005
13 years 8 months ago
2005
Financial options whose payoff depends critically on historical prices are called pathdependent options. Their prices are usually harder to calculate than options whose prices do ...
ADCM
2007
13 years 8 months ago
2007
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
DCG
2008
13 years 8 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...