Sciweavers

422 search results - page 55 / 85
» Generalizations of small profinite structures
Sort
View
STACS
2010
Springer
14 years 3 months ago
Unsatisfiable Linear CNF Formulas Are Large and Complex
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
Dominik Scheder
CVPR
2009
IEEE
14 years 3 months ago
On bias correction for geometric parameter estimation in computer vision
Maximum likelihood (ML) estimation is widely used in many computer vision problems involving the estimation of geometric parameters, from conic fitting to bundle adjustment for s...
Takayuki Okatani, Koichiro Deguchi
SAC
2009
ACM
14 years 3 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
SI3D
2009
ACM
14 years 3 months ago
Approximating dynamic global illumination in image space
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
Tobias Ritschel, Thorsten Grosch, Hans-Peter Seide...
ICSE
2009
IEEE-ACM
14 years 3 months ago
WISE: Automated test generation for worst-case complexity
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to ...
Jacob Burnim, Sudeep Juvekar, Koushik Sen