Sciweavers

12289 search results - page 1800 / 2458
» computing 2006
Sort
View
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 7 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
16 years 7 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
190
Voted
EDBT
2006
ACM
145views Database» more  EDBT 2006»
16 years 7 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
PERCOM
2006
ACM
16 years 6 months ago
Cantag: an open source software toolkit for designing and deploying marker-based vision systems
This paper presents Cantag, an open source software toolkit for building Marker-based Vision (MBV) systems that can identify and accurately locate printed markers in three dimensi...
Andrew C. Rice, Alastair R. Beresford, Robert K. H...
209
Voted
PERCOM
2006
ACM
16 years 6 months ago
Distributed Cross-Layer Scheduling for In-Network Sensor Query Processing
In-network sensor query processing is a cross-layer design paradigm in which networked sensor nodes process data acquisitional queries in collaboration with one another. As power ...
Hejun Wu, Qiong Luo, Wenwei Xue
« Prev « First page 1800 / 2458 Last » Next »