Sciweavers

1192 search results - page 168 / 239
» Computing Weakest Readings
Sort
View
EWSN
2009
Springer
16 years 4 months ago
Sundial: Using Sunlight to Reconstruct Global Timestamps
Abstract. This paper investigates postmortem timestamp reconstruction in environmental monitoring networks. In the absence of a timesynchronization protocol, these networks use mul...
Jayant Gupchup, Razvan Musaloiu-Elefteri, Alexande...
116
Voted
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 4 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
125
Voted
ICIAP
2005
ACM
16 years 3 months ago
Interactive, Mobile, Distributed Pattern Recognition
As the accuracy of conventional classifiers, based only on a static partitioning of feature space, appears to be approaching a limit, it may be useful to consider alternative appro...
George Nagy
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
16 years 3 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
PERCOM
2007
ACM
16 years 3 months ago
Energy-Aware Tag Anti-Collision Protocols for RFID Systems
Energy consumption of mobile readers is becoming an important issue as applications of RFID systems pervade different aspects of our lives. Surprisingly, however, these systems ar...
Vinod Namboodiri, Lixin Gao