Sciweavers

5316 search results - page 167 / 1064
» Which Search Problems Are Random
Sort
View
132
Voted
IJCAI
2007
15 years 5 months ago
Training Conditional Random Fields Using Virtual Evidence Boosting
While conditional random fields (CRFs) have been applied successfully in a variety of domains, their training remains a challenging task. In this paper, we introduce a novel trai...
Lin Liao, Tanzeem Choudhury, Dieter Fox, Henry A. ...
172
Voted
DAWAK
2000
Springer
15 years 8 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
133
Voted
CP
2007
Springer
15 years 7 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
146
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 7 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
138
Voted
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro