11 search results - page 2 / 3 » A Soft Constraint of Equality: Complexity and Approximabilit... |
DIALM
2008
ACM
13 years 7 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
ECCC
2000
13 years 5 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
RECOMB
2008
Springer
14 years 6 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
UAI
1997
13 years 7 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
VLDB
2007
ACM
14 years 6 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...