Sciweavers

1518 search results - page 286 / 304
» Exact and Approximate Bandwidth
Sort
View
ICFP
2007
ACM
14 years 6 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 4 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
14 years 4 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
ALT
2006
Springer
14 years 3 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
CVPR
2009
IEEE
14 years 1 months ago
Robust shadow and illumination estimation using a mixture model
Illuminant estimation from shadows typically relies on accurate segmentation of the shadows and knowledge of exact 3D geometry, while shadow estimation is difficult in the presen...
Alexandros Panagopoulos, Dimitris Samaras, Nikos P...