Sciweavers

29082 search results - page 5557 / 5817
» The Time-Triggered Model of Computation
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 7 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
16 years 7 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
ICALP
2009
Springer
16 years 7 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
VLDB
2006
ACM
171views Database» more  VLDB 2006»
16 years 6 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
16 years 6 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
« Prev « First page 5557 / 5817 Last » Next »