Sciweavers

3250 search results - page 419 / 650
» Parameterized Learning Complexity
Sort
View
CVPR
2000
IEEE
15 years 8 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
SIGCSE
2000
ACM
119views Education» more  SIGCSE 2000»
15 years 8 months ago
Bugs as features: teaching network protocols through debugging
Being exposed to well-written code is a valuable experience for students -- especially when the code is larger or more complex than they are currently capable of writing. In addit...
Brad Richards
CIKM
2000
Springer
15 years 8 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
SEAL
1998
Springer
15 years 8 months ago
Genetic Programming with Active Data Selection
Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting ...
Byoung-Tak Zhang, Dong-Yeon Cho
ICIP
2007
IEEE
15 years 8 months ago
Real-Time Pedestrian Detection using Eigenflow
We propose a novel learning algorithm to detect moving pedestrians from a stationary camera in real-time. The algorithm learns a discriminative model based on eigenflow, i.e. the ...
Dhiraj Goel, Tsuhan Chen