4047 search results - page 73 / 810 » The Discrete Basis Problem |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
JMLR
2010
13 years 4 months ago
2010
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
ICMCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Segmenting the speech signals on the basis of time-frequency analysis is the most natural approach. Boundaries are located in places where energy of some frequency subband rapidly...
ECCV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The decomposition of images into their meaningful components is one of the major tasks in computer vision. Tadmor, Nezzar and Vese [1] have proposed a general approach fo...