20197 search results - page 685 / 4040 » Comparing Computational Power |
162
Voted
TCS
1998
15 years 7 months ago
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
212
click to vote
ISCAS
2011
IEEE
14 years 11 months ago
2011
IEEE
— In this study, synchronization phenomena observed in coupled polygonal oscillatory networks with frustration is investigated. We focus on the power consumption of coupling resi...
175
click to vote
ECCV
1994
Springer
16 years 9 months ago
1994
Springer
Abstract. We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms re...
181
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this study a confidence measure for probability density functions (pdfs) is presented. The measure can be used in one-class classification to select a pdf threshold for class i...
160
click to vote
ICCAD
2007
IEEE
16 years 4 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...