719 search results - page 119 / 144 » Adaptive Online Time Allocation to Search Algorithms |
117
Voted
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
130
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
156
Voted
VMV
2001
15 years 5 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
127
click to vote
ICRA
1999
IEEE
15 years 8 months ago
1999
IEEE
We consider the problem of automatically generating viewpoint motions for a virtual camera tracking a moving target. Given the target's trajectory, we plan the motion of a ca...