1651 search results - page 135 / 331 » Measuring the Complexity of Classification Problems |
82
Voted
COMPGEOM
1987
ACM
15 years 1 months ago
1987
ACM
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
SIAMSC
2008
14 years 10 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
82
Voted
CVPR
2005
IEEE
16 years 7 days 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...
KDD
1995
ACM
15 years 1 months ago
1995
ACM
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
111
click to vote
CCCG
2008
14 years 11 months ago
2008
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...