692 search results - page 76 / 139 » BDD minimization for approximate computing |
SIBGRAPI
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
95
Voted
CVPR
2005
IEEE
15 years 4 months ago
2005
IEEE
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
85
Voted
ISSAC
2004
Springer
15 years 4 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
117
click to vote
PARA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
DAGSTUHL
2007
15 years 13 days ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...