Sciweavers

2252 search results - page 55 / 451
» Improving Random Forests
Sort
View
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 6 months ago
Improved Consistent Sampling, Weighted Minhash and L1 Sketching
Abstract--We propose a new Consistent Weighted Sampling method, where the probability of drawing identical samples for a pair of inputs is equal to their Jaccard similarity. Our me...
Sergey Ioffe
EMO
2005
Springer
123views Optimization» more  EMO 2005»
14 years 1 months ago
Initial Population Construction for Convergence Improvement of MOEAs
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
Christian Haubelt, Jürgen Gamenik, Jürge...
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 7 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger
MONET
2011
13 years 3 months ago
Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding
— We investigate the throughput improvement that ZIGZAG decoding (Gollakota and Katabi (2008)) can achieve in multi-user random access systems. ZIGZAG is a recently proposed 802....
Jeongyeup Paek, Michael J. Neely