Sciweavers

627 search results - page 49 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 3 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
16 years 6 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
CLOUDCOM
2010
Springer
15 years 4 months ago
Efficient Metadata Generation to Enable Interactive Data Discovery over Large-Scale Scientific Data Collections
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...
Sangmi Lee Pallickara, Shrideep Pallickara, Milija...
JUCS
2007
122views more  JUCS 2007»
15 years 6 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
INFOCOM
2010
IEEE
15 years 4 months ago
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...
Peter Lieven, Björn Scheuermann