Sciweavers

725 search results - page 50 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
DAGSTUHL
2007
14 years 11 months ago
Approximating Solution Structure
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
Iris van Rooij, Matthew Hamilton, Moritz Müll...
CAD
2005
Springer
14 years 9 months ago
Industrial geometry: recent advances and applications in CAD
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 3 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
JAIR
2008
120views more  JAIR 2008»
14 years 9 months ago
Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
Saher Esmeir, Shaul Markovitch