Sciweavers

736 search results - page 112 / 148
» A dynamic data structure for approximate range searching
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
CHI
2005
ACM
14 years 9 months ago
prefuse: a toolkit for interactive information visualization
Although information visualization (infovis) technologies have proven indispensable tools for making sense of complex data, wide-spread deployment has yet to take hold, as success...
Jeffrey Heer, Stuart K. Card, James A. Landay
WMI
2001
114views more  WMI 2001»
13 years 10 months ago
A high capacity multihop packet CDMA wireless network
: An adhoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administra...
Ali Nabi Zadeh, Bijan Jabbari
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 9 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
14 years 2 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro