Sciweavers

1461 search results - page 255 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 10 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 10 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
PET
2010
Springer
15 years 8 months ago
Achieving Efficient Query Privacy for Location Based Services
Mobile smartphone users frequently need to search for nearby points of interest from a location based service, but in a way that preserves the privacy of the users' locations...
Femi G. Olumofin, Piotr K. Tysowski, Ian Goldberg,...
DGO
2006
136views Education» more  DGO 2006»
15 years 7 months ago
Automated classification of congressional legislation
For social science researchers, content analysis and classification of United States Congressional legislative activities has been time consuming and costly. The Library of Congre...
Stephen Purpura, Dustin Hillard
ATAL
2010
Springer
15 years 7 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...