Sciweavers

277 search results - page 47 / 56
» Prediction from Partial Data, Renormalization, and Averaging
Sort
View
CASES
2006
ACM
16 years 3 days ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
179
Voted
EDBT
2009
ACM
184views Database» more  EDBT 2009»
16 years 28 days ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
16 years 6 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.
MOBICOM
2004
ACM
15 years 11 months ago
Exploiting medium access diversity in rate adaptive wireless LANs
Recent years have seen the growing popularity of multi-rate wireless network devices (e.g., 802.11a cards) that can exploit variations in channel conditions and improve overall ne...
Zhengrong Ji, Yi Yang, Junlan Zhou, Mineo Takai, R...
CF
2009
ACM
16 years 20 days ago
A light-weight fairness mechanism for chip multiprocessor memory systems
Chip Multiprocessor (CMP) memory systems suffer from the effects of destructive thread interference. This interference reduces performance predictability because it depends heavil...
Magnus Jahre, Lasse Natvig