Sciweavers

4850 search results - page 601 / 970
» Approximate Data Structures with Applications
Sort
View
239
Voted
PODC
2011
ACM
14 years 10 months ago
Scalability versus semantics of concurrent FIFO queues
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
Hannes Payer, Harald Röck, Christoph M. Kirsc...
215
Voted
BXML
2004
15 years 8 months ago
Metaschema Layering for XML
: The Extensible Markup Language (XML) is based on the concept of schema languages, which are used for validation of XML documents. In most cases, the metamodeling view of XML-base...
Erik Wilde
MOBIHOC
2010
ACM
15 years 5 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
244
Voted
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
16 years 2 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
226
Voted
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 7 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang