Sciweavers

36781 search results - page 304 / 7357
» Parameterizing by the Number of Numbers
Sort
View
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 9 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
IQ
2007
15 years 7 months ago
A Flexible And Generic Data Quality Metamodel
: DQ metadata can be stored in a Metadata Repository (MDR). The structure of the MDR should be carefully defined to ensure a maximum amount of flexibility, generality and ease of u...
David Becker, William McMullen, Kevin Hetherington...
PAMI
2006
178views more  PAMI 2006»
15 years 6 months ago
Learning Nonlinear Image Manifolds by Global Alignment of Local Linear Models
Appearance-based methods, based on statistical models of the pixel values in an image (region) rather than geometrical object models, are increasingly popular in computer vision. I...
Jakob J. Verbeek
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 6 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
JCO
2010
101views more  JCO 2010»
15 years 4 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier