111 search results - page 21 / 23 » The Generalized Singular Value Decomposition and the Method ... |
IOR
2006
13 years 7 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Image matting deals with finding the probability that each pixel in an image belongs to a user specified `object' or to the remaining `background'. Most existing methods...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
GVD
2004
13 years 8 months ago
2004
Abstract. Checking the consistency of query conditions is an old problem, and there are already many proposed solutions. Since the problem is in general undecidable, there is not a...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...