Sciweavers

23589 search results - page 4407 / 4718
» Uncheatable Distributed Computations
Sort
View
WSNA
2003
ACM
15 years 12 months ago
Proximity interactions between wireless sensors and their application
Many applications in ubiquitous computing rely on knowing where people and objects are relative to each other. By placing small wireless sensors on people, at specific locations, ...
Waylon Brunette, Carl Hartung, Ben Nordstrom, Gaet...
ECCV
2010
Springer
15 years 12 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
ISCA
2010
IEEE
240views Hardware» more  ISCA 2010»
15 years 11 months ago
Modeling critical sections in Amdahl's law and its implications for multicore design
This paper presents a fundamental law for parallel performance: it shows that parallel performance is not only limited by sequential code (as suggested by Amdahl’s law) but is a...
Stijn Eyerman, Lieven Eeckhout
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 11 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 11 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
« Prev « First page 4407 / 4718 Last » Next »