4526 search results - page 497 / 906 » Algorithmic problems related to the Internet |
147
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
189
click to vote
IROS
2006
IEEE
16 years 28 days ago
2006
IEEE
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
189
click to vote
WAIM
2005
Springer
16 years 11 days ago
2005
Springer
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
201
click to vote
FCT
2005
Springer
16 years 10 days ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
184
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...