1279 search results - page 142 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
128
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
126
click to vote
JCO
2008
15 years 1 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
136
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
145
click to vote
SIAMJO
2002
15 years 1 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
102
click to vote
ICCV
2005
IEEE
15 years 7 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...