372 search results - page 58 / 75 » A Study of The Fragile Base Class Problem |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...