Sciweavers

224 search results - page 13 / 45
» Neighborhood systems and approximate retrieval
Sort
View
TREC
1998
13 years 11 months ago
ClickIR: Text Retrieval using a Dynamic Hypertext Interface
In this report we describe our model of dynamic hypertext and how the ClickIR system uses this model to assist users in interactive search. The system was used in both the ad hoc ...
Richard C. Bodner, Mark H. Chignell
HOTOS
2007
IEEE
14 years 1 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
HICSS
2003
IEEE
108views Biometrics» more  HICSS 2003»
14 years 3 months ago
Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks
In this paper, we propose some improvements to the flooding protocols that aim to efficiently broadcast a given information through the whole ad-hoc network. These improvements ...
Julien Cartigny, David Simplot
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
14 years 10 months ago
Sonnet: an efficient distributed content-based dissemination broker
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
Aoying Zhou, Weining Qian, Xueqing Gong, Minqi Zho...
MCS
2008
Springer
13 years 9 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich