Sciweavers

1310 search results - page 130 / 262
» Learning the k in k-means
Sort
View
FCT
2009
Springer
16 years 28 days ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
ECCV
2006
Springer
16 years 8 months ago
Sparse Flexible Models of Local Features
Abstract. In recent years there has been growing interest in recognition models using local image features for applications ranging from long range motion matching to object class ...
Gustavo Carneiro, David Lowe
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 12 months ago
Constructing good learners using evolved pattern generators
Self-organization of brain areas in animals begins prenatally, evidently driven by spontaneously generated internal patterns. The neural structures continue to develop postnatally...
Vinod K. Valsalam, James A. Bednar, Risto Miikkula...
ICML
2004
IEEE
16 years 7 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
SIGCSE
2009
ACM
119views Education» more  SIGCSE 2009»
16 years 7 months ago
Implications of integrating test-driven development into CS1/CS2 curricula
Many academic and industry professionals have called for more testing in computer science curricula. Test-driven development (TDD) has been proposed as a solution to improve testi...
Chetan Desai, David S. Janzen, John Clements