13603 search results - page 204 / 2721 » On the Complexity of Computing Treelength |
130
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
175
click to vote
NN
2006
Springer
15 years 4 months ago
2006
Springer
How does attention operate in natural scenes? We show that the receptive fields of inferior temporal cortex neurons that implement object representations become small and located ...
135
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
128
click to vote
CCA
2005
Springer
15 years 6 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
103
click to vote
BMVC
2000
15 years 5 months ago
2000
In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for vel...