Sciweavers

157 search results - page 15 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
COMPGEOM
2008
ACM
13 years 9 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
VTC
2007
IEEE
164views Communications» more  VTC 2007»
14 years 2 months ago
Joint Distributed Clustering and Ranging for Wireless Ad-Hoc Sensor Networks
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
Chih-Yu Wen, Jun-Koh Chen, William A. Sethares
AINA
2007
IEEE
14 years 2 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
DASFAA
2011
IEEE
250views Database» more  DASFAA 2011»
12 years 11 months ago
An FTL-Agnostic Layer to Improve Random Write on Flash Memory
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
Brice Chardin, Olivier Pasteur, Jean-Marc Petit