1332 search results - page 16 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...