Sciweavers

535 search results - page 42 / 107
» Generalized Version Space Trees
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
14 years 9 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ICML
2009
IEEE
16 years 18 days ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 4 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
DAGSTUHL
2006
15 years 1 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 6 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher