Sciweavers

3894 search results - page 251 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
16 years 1 days ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
COR
2006
113views more  COR 2006»
15 years 6 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
ISMIR
2004
Springer
157views Music» more  ISMIR 2004»
15 years 12 months ago
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
Anna Lubiw, Luke Tanur
ICIP
2006
IEEE
16 years 8 months ago
Support Vector Machines for Camera Calibration Problem
This paper presents a statistical learning-based solution to the camera calibration problem in which the Support Vector Machines (SVM) are used for the estimation of the projectio...
Refaat M. Mohamed, Abdelrehim H. Ahmed, Ahmed Eid,...
ICML
2004
IEEE
16 years 7 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye