Sciweavers

2252 search results - page 180 / 451
» Improving Random Forests
Sort
View
FOCS
1999
IEEE
15 years 6 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
107
Voted
SIGIR
2010
ACM
15 years 6 months ago
Clicked phrase document expansion for sponsored search ad retrieval
We present a document expansion approach that uses Conditional Random Field (CRF) segmentation to automatically extract salient phrases from ad titles. We then supplement the ad d...
Dustin Hillard, Chris Leggetter
123
Voted
GECCO
2000
Springer
121views Optimization» more  GECCO 2000»
15 years 6 months ago
Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models
In this paper we describe a method for improving genetic-algorithm-based optimization using informed genetic operators. The idea is to make the genetic operators such as mutation ...
Khaled Rasheed, Haym Hirsh
124
Voted
FOCS
1992
IEEE
15 years 6 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
137
Voted
ICIAP
2007
ACM
15 years 4 months ago
A New Stereo Algorithm Integrating Luminance, Gradient and Segmentation Informations in a Belief-Propagation Framework
The paper deals with the design and implementation of a stereo algorithm. Disparity map is formulated as a Markov Random Field with a new smoothness constraint depending not only ...
Nello Balossino, Maurizio Lucenteforte, Luca Piova...