1601 search results - page 132 / 321 » Closed Sets for Labeled Data |
163
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
160
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
193
click to vote
LATA
2010
Springer
15 years 10 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This work describes a novel methodology for automatic contour extraction from 2D images of 3D neurons (e.g. camera lucida images and other types of 2D microscopy). Most contour-ba...
184
click to vote
TASLP
2008
15 years 6 months ago
2008
We describe an acoustic chord transcription system that uses symbolic data to train hidden Markov models and gives best-of-class frame-level recognition results. We avoid the extre...