Sciweavers

2254 search results - page 50 / 451
» Computing the minimal covering set
Sort
View
DAC
2004
ACM
14 years 1 months ago
On test generation for transition faults with minimized peak power dissipation
This paper presents a method of generating tests for transition faults using tests for stuck-at faults such that the peak power is the minimum possible using a given set of tests ...
Wei Li, Sudhakar M. Reddy, Irith Pomeranz
ICCV
1999
IEEE
14 years 12 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 10 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
3DPVT
2006
IEEE
174views Visualization» more  3DPVT 2006»
14 years 4 months ago
Two Stage View Planning for Large-Scale Site Modeling
We present a systematic view planning method to assist construction of 3-D models of large outdoor sites using a mobile robot platform with mounted scanner. In the first stage, w...
Paul Blaer, Peter K. Allen
ICTAI
2008
IEEE
14 years 4 months ago
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...
Éric Grégoire, Bertrand Mazure, C&ea...