2254 search results - page 102 / 451 » Computing the minimal covering set |
123
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
111
Voted
EUROCOLT
1999
Springer
15 years 5 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
100
Voted
SC
2003
ACM
15 years 6 months ago
2003
ACM
Buffered CoScheduled MPI (BCS-MPI) introduces a new approach to design the communication layer for largescale parallel machines. The emphasis of BCS-MPI is on the global coordinat...
242
Voted
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
"In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and theref...
125
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....