633 search results - page 54 / 127 » A Classified and Comparative Study of Edge Detection Algorit... |
151
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
167
Voted
SIMVIS
2004
15 years 6 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
116
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
142
Voted
ML
2006
ACM
15 years 5 months ago
2006
ACM
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
146
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...