4850 search results - page 601 / 970 » Approximate Data Structures with Applications |
215
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
187
Voted
BXML
2004
15 years 8 months ago
2004
: 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...
167
Voted
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
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 ...
221
Voted
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— 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...
205
Voted
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...