159 search results - page 27 / 32 » Geometric Bounds for Generalization in Boosting |
129
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
87
Voted
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
81
Voted
TASLP
2010
14 years 4 months ago
2010
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
The Conditional Random Fields (CRF) model, using
patch-based classification bound with context information,
has recently been widely adopted for image segmentation/
labeling. In...