Sciweavers

2252 search results - page 168 / 451
» Improving Random Forests
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 11 days ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
EC
2008
120views ECommerce» more  EC 2008»
13 years 8 months ago
Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
Shengxiang Yang
ICIP
2008
IEEE
14 years 10 months ago
Cooperative disparity and object boundary estimation
In this paper we carry out cooperatively both disparity and object boundary estimation by setting the two tasks in a unified Markovian framework. We introduce a new joint probabil...
Ramya Narasimha, Elise Arnaud, Florence Forbes, Ra...
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
14 years 9 months ago
A Framework for High-Accuracy Privacy-Preserving Mining
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, ...
Shipra Agrawal, Jayant R. Haritsa
STACS
2009
Springer
14 years 3 months ago
A Comparison of Techniques for Sampling Web Pages
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
Eda Baykan, Monika Rauch Henzinger, Stefan F. Kell...