3874 search results - page 265 / 775 » Approximation Algorithms for k-hurdle Problems |
138
click to vote
TALG
2010
15 years 2 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
136
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
142
click to vote
SIAMSC
2010
14 years 11 months ago
2010
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
119
click to vote
APPML
2007
15 years 4 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
142
click to vote
AAAI
2007
15 years 6 months ago
2007
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...