Sciweavers

1279 search results - page 19 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
TALG
2008
86views more  TALG 2008»
13 years 8 months ago
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
Shuchi Chawla, Anupam Gupta, Harald Räcke
ICML
2004
IEEE
14 years 9 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
14 years 1 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
FOCS
2008
IEEE
14 years 3 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
BICOB
2009
Springer
14 years 3 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...