77 search results - page 6 / 16 » Timing optimization by restructuring long combinatorial path... |
EMMCVPR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
DASFAA
2008
IEEE
14 years 1 months ago
2008
IEEE
View updating is a long standing difficult problem. Given a view defined over base data sources and a view update, there are several different updates over the base data sources,...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
VTS
1997
IEEE
13 years 11 months ago
1997
IEEE
Accumulators based on addition or subtraction can be used as test pattern generators. Some circuits, however, require long test lengths if the parameters of the accumulator are no...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...