1233 search results - page 219 / 247 » Extensible Point Location Algorithm |
COLT
1999
Springer
15 years 2 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
ADHOC
2005
14 years 9 months ago
2005
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper introduces a new algorithm, Q2, foroptimizingthe expected output ofamultiinput noisy continuous function. Q2 is designed to need only a few experiments, it avoids stron...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...