Sciweavers

962 search results - page 93 / 193
» Near-optimal solutions for the generalized max-controlled se...
Sort
View
COMPGEOM
2009
ACM
15 years 4 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
CIKM
2009
Springer
15 years 4 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
CVPR
2009
IEEE
16 years 5 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
ICIP
2005
IEEE
15 years 11 months ago
Finding the global minimum for binary image restoration
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
Tony F. Chan, Selim Esedoglu, Mila Nikolova
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
15 years 4 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank