Sciweavers

2412 search results - page 51 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 11 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm
IROS
2008
IEEE
144views Robotics» more  IROS 2008»
14 years 4 months ago
Frame rate object extraction from video sequences with self organizing networks and statistical background detection
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...
Thiago C. Bellardi, Dizan Vasquez, Christian Laugi...
DICTA
2003
13 years 11 months ago
Embedded Voxel Colouring
Abstract. The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods have proven to be a strong altern...
Carlos Leung, Ben Appleton, Changming Sun
DCC
2004
IEEE
14 years 9 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
14 years 3 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...