Sciweavers

1435 search results - page 227 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer
CIKM
2009
Springer
15 years 1 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
CVPR
2010
IEEE
14 years 11 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
14 years 10 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
TVCG
2010
157views more  TVCG 2010»
14 years 8 months ago
Crease Surfaces: From Theory to Extraction and Application to Diffusion Tensor MRI
—Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, ...
Thomas Schultz, Holger Theisel, Hans-Peter Seidel