Sciweavers

2904 search results - page 258 / 581
» Number Forms in the Brain
Sort
View
CGF
1998
127views more  CGF 1998»
15 years 7 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...
CPC
1998
123views more  CPC 1998»
15 years 7 months ago
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
Michael Molloy, Bruce A. Reed
IANDC
1998
70views more  IANDC 1998»
15 years 7 months ago
The Generating Power of Total Deterministic Tree Transducers
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...
Sebastian Maneth
IJCV
1998
135views more  IJCV 1998»
15 years 7 months ago
A Multibody Factorization Method for Independently Moving Objects
The structure-from-motion problem has been extensively studied in the field of computer vision. Yet, the bulk of the existing work assumes that the scene contains only a single mo...
João Paulo Costeira, Takeo Kanade
JGAA
2002
99views more  JGAA 2002»
15 years 7 months ago
Graph Layout Aesthetics in UML Diagrams: User Preferences
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...