Sciweavers

541 search results - page 50 / 109
» Query Strategies for Priced Information
Sort
View
CIKM
2005
Springer
15 years 7 months ago
Localized routing trees for query processing in sensor networks
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
Jie Lian, Lei Chen 0002, Kshirasagar Naik, M. Tame...
ICRA
2007
IEEE
125views Robotics» more  ICRA 2007»
15 years 8 months ago
Single-Query Motion Planning with Utility-Guided Random Trees
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
Brendan Burns, Oliver Brock
APVIS
2011
14 years 1 months ago
The NETSPEAK WORDGRAPH: Visualizing keywords in context
NETSPEAK helps writers in choosing words while writing a text. It checks for the commonness of phrases and allows for the retrieval of alternatives by means of wildcard queries. T...
Patrick Riehmann, Henning Gruendl, Bernd Froehlich...
WWW
2003
ACM
16 years 2 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
COLT
2007
Springer
15 years 8 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum