Sciweavers

4850 search results - page 638 / 970
» Approximate Data Structures with Applications
Sort
View
252
Voted
VLDB
2007
ACM
159views Database» more  VLDB 2007»
16 years 6 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
MM
2009
ACM
118views Multimedia» more  MM 2009»
16 years 28 days ago
Vocabulary-based hashing for image search
This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated wi...
Yingyu Liang, Jianmin Li, Bo Zhang
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 10 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
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,...
CIDR
2007
111views Algorithms» more  CIDR 2007»
15 years 7 months ago
Moirae: History-Enhanced Monitoring
In this paper, we investigate the benefits and challenges of integrating history into a near-real-time monitoring system; and present a general purpose continuous monitoring engi...
Magdalena Balazinska, YongChul Kwon, Nathan Kuchta...