Sciweavers

37 search results - page 3 / 8
» A Hardware-Oriented Method for Evaluating Complex Polynomial...
Sort
View
IMAGING
2004
13 years 7 months ago
Maintaining an Accurate Printer Characterization
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
David Littlewood, Ganesh Subbarayan
FOCS
1998
IEEE
13 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 5 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
ICCV
2007
IEEE
13 years 9 months ago
Efficient Generic Calibration Method for General Cameras with Single Centre of Projection
Generic camera calibration is a non-parametric calibration technique that is applicable to any type of vision sensor. However, the standard generic calibration method was develope...
Aubrey K. Dunne, John Mallon, Paul F. Whelan
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 3 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi