Sciweavers

3341 search results - page 519 / 669
» On Bounded Queries and Approximation
Sort
View
XSYM
2004
Springer
115views Database» more  XSYM 2004»
15 years 11 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
ICWE
2010
Springer
15 years 10 months ago
Ranking the Linked Data: The Case of DBpedia
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
ICRA
2000
IEEE
84views Robotics» more  ICRA 2000»
15 years 10 months ago
Enhancing Randomized Motion Planners: Exploring with Haptic Hints
In this paper, we investigate methods for enabling a human operator and an automatic motion planner to cooperatively solve a motion planning query. Our work is motivated by our ex...
O. Burçhan Bayazit, Guang Song, Nancy M. Am...
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
15 years 9 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer
AAAI
2007
15 years 8 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...