Sciweavers

530 search results - page 32 / 106
» An Algorithm for Approximating the Satisfiability Problem of...
Sort
View
IS
2008
13 years 7 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
SIAMDM
2010
75views more  SIAMDM 2010»
13 years 2 months ago
An Efficient Sparse Regularity Concept
Let A be a 0/1 matrix of size m
Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze
JC
2007
94views more  JC 2007»
13 years 7 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
DCC
2003
IEEE
14 years 7 months ago
Design of Optimal Quantizers for Distributed Source Coding
We address the problem of designing optimal quantizers for distributed source coding. The generality of our formulation includes both the symmetric and asymmetric scenarios, toget...
David Rebollo-Monedero, Rui Zhang, Bernd Girod
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
14 years 2 days ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar