20441 search results - page 211 / 4089 » Locally Computable Structures |
128
click to vote
WSCG
2003
15 years 4 months ago
2003
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which â...
123
click to vote
POPL
2010
ACM
16 years 14 days ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
137
click to vote
3DPVT
2004
IEEE
15 years 6 months ago
2004
IEEE
We propose a new data structure, called Fan-Meshes (FM), for reconstructing 3D models and scenes represented by dense scanning point clouds. It is a local piecewise linear approxi...
154
click to vote
NIPS
2004
15 years 4 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
133
click to vote
FINTAL
2006
15 years 6 months ago
2006
Abstract. Every language employs its own coordination strategies, according to the type of coordinating marking, the pattern of marking, the position of the marker, and the phrase ...