10608 search results - page 634 / 2122 » Complexity of O'Hara's Algorithm |
152
click to vote
BMVC
2000
15 years 8 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...
193
click to vote
PDPTA
2000
15 years 8 months ago
2000
Abstract We describe an event-based, publishand-subscribe system based on using "smart subscriptions" to recognize weakly structured events. We present a hierarchy of sub...
196
click to vote
NIPS
1993
15 years 8 months ago
1993
This paper introduces GNARL, an evolutionary program which induces recurrent neural networks that are structurally unconstrained. In contrast to constructive and destructive algor...
180
click to vote
CGF
2008
15 years 7 months ago
2008
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
165
click to vote
IPL
2008
15 years 7 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...