Sciweavers

352 search results - page 53 / 71
» Experimental Analysis of Approximation Algorithms for the Ve...
Sort
View
CPAIOR
2011
Springer
12 years 11 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 8 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 7 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
JDWM
2007
122views more  JDWM 2007»
13 years 7 months ago
A Hyper-Heuristic for Descriptive Rule Induction
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
Tho Hoan Pham, Tu Bao Ho
IJDAR
2008
92views more  IJDAR 2008»
13 years 7 months ago
Optical recognition of psaltic Byzantine chant notation
Abstract This paper describes a document recognition system for the modern neume based notation of Byzantine music. We propose algorithms for page segmentation, lyrics removal, syn...
Christoph Dalitz, Georgios K. Michalakis, Christin...