7015 search results - page 80 / 1403 » Approximation algorithms for co-clustering |
COCOON
2006
Springer
14 years 26 days ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
AAAI
2010
13 years 10 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
CSC
2009
13 years 10 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
DISOPT
2008
13 years 9 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
JGAA
2006
13 years 9 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...