2082 search results - page 61 / 417 » Change Paths in Reasoning! |
ICIAP
2003
ACM
15 years 11 months ago
2003
ACM
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...
73
Voted
WEA
2009
Springer
15 years 5 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
85
Voted
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
89
Voted
DAC
1996
ACM
15 years 3 months ago
1996
ACM
We propose a low-overhead scan design methodology which employs a new test point insertion technique to establish scan paths through the functional logic. The technique re-uses th...
74
Voted
ANOR
2010
14 years 11 months ago
2010
Many image denoising methods can be characterized as minimizing "loss + penalty," where the "loss" measures the fidelity of the denoised image to the data, and ...