2376 search results - page 23 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
133
click to vote
DASFAA
2008
IEEE
15 years 7 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
155
click to vote
CIC
2006
15 years 6 months ago
2006
Structured peer to peer (P2P) systems organize a large number of nodes in well-defined structures and provide efficient and scalable search functionalities. They have been used as ...
170
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
164
click to vote
PKC
1998
Springer
15 years 9 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
152
click to vote
ECCC
2006
15 years 5 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...