3105 search results - page 373 / 621 » The Path-Packing Structure of Graphs |
134
click to vote
ICIP
2008
IEEE
16 years 6 months ago
2008
IEEE
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
135
click to vote
ICIP
2009
IEEE
16 years 5 months ago
2009
IEEE
In video surveillance, the sizes of face images are very small. However, few works have been done to investigate scalerobust face recognition. Our experiments on appearancebased m...
123
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
| This paper reports the design of BIST structures for sequential machines. Testability of an FSM is limited due to the fact that some machine states remain unreachable and some ac...
158
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
153
click to vote
CC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...