Sciweavers

860 search results - page 90 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
ICDCSW
2003
IEEE
14 years 1 months ago
Foundations of Security for Hash Chains in Ad Hoc Networks
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...
Phillip G. Bradford, Olga V. Gavrylyako
SIROCCO
2003
13 years 9 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
KDD
2002
ACM
183views Data Mining» more  KDD 2002»
14 years 8 months ago
E-CAST: A Data Mining Algorithm for Gene Expression Data
Data clustering methods have been proven to be a successful data mining technique in the analysis of gene expression data. The Cluster affinity search technique (CAST) developed b...
Abdelghani Bellaachia, David Portnoy, Yidong Chen,...
NIPS
2001
13 years 9 months ago
KLD-Sampling: Adaptive Particle Filters
Over the last years, particle filters have been applied with great success to a variety of state estimation problems. We present a statistical approach to increasing the efficienc...
Dieter Fox
ICDE
2007
IEEE
109views Database» more  ICDE 2007»
14 years 9 months ago
Evaluating Proximity Relations Under Uncertainty
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
Zhengdao Xu, Hans-Arno Jacobsen