Sciweavers

2520 search results - page 33 / 504
» The complexity of approximating entropy
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Mapping Natural Image Patches by Explicit and Implicit Manifolds
Image patches are fundamental elements for object modeling and recognition. However, there has not been a panoramic study of the structures of the whole ensemble of natural image ...
Kent Shi, Song Chun Zhu
DBPL
2005
Springer
130views Database» more  DBPL 2005»
14 years 3 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
IS
2008
13 years 9 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...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 3 months ago
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
Jérôme Monnot
UAI
2004
13 years 11 months ago
On-line Prediction with Kernels and the Complexity Approximation Principle
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
Alexander Gammerman, Yuri Kalnishkan, Vladimir Vov...