Sciweavers

4085 search results - page 600 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Building Sparse Large Margin Classifiers
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
Bernhard Schölkopf, Gökhan H. Bakir, Min...
ICML
2000
IEEE
16 years 7 months ago
Solving the Multiple-Instance Problem: A Lazy Learning Approach
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being...
Jun Wang, Jean-Daniel Zucker
CVPR
2010
IEEE
16 years 1 months ago
Motion Estimation with Non-Local Total Variation Regularization
State-of-the-art motion estimation algorithms suffer from three major problems: Poorly textured regions, occlusions and small scale image structures. Based on the Gestalt principle...
Manuel Werlberger, Thomas Pock, Horst Bischof
AE
2007
Springer
16 years 1 months ago
A Study of Evaluation Functions for the Graph K-Coloring Problem
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
16 years 18 days ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin