Sciweavers

4781 search results - page 152 / 957
» Complexity at large
Sort
View
78
Voted
TOG
2008
79views more  TOG 2008»
15 years 22 days ago
Continuous model synthesis
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
Paul Merrell, Dinesh Manocha
79
Voted
ICPR
2010
IEEE
15 years 6 months ago
On the Scalability of Evidence Accumulation Clustering
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
André Lourenço, Ana Luisa Nobre Fred, Anil Jain
SLE
2009
Springer
15 years 7 months ago
Composing Feature Models
Feature modeling is a widely used technique in Software Product Line development. Feature models allow stakeholders to describe domain concepts in terms of commonalities and diffe...
Mathieu Acher, Philippe Collet, Philippe Lahire, R...
125
Voted
WCC
2005
Springer
197views Cryptology» more  WCC 2005»
15 years 6 months ago
Linear Filtering of Nonlinear Shift-Register Sequences
Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period qn − 1 are investigated under linear operations on sequences. We prove that all members o...
Berndt M. Gammel, Rainer Göttfert
90
Voted
WSCG
2001
98views more  WSCG 2001»
15 years 2 months ago
Geometric Simplification for Efficient Occlusion Culling in Urban Scenes
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...
Rick Germs, Frederik W. Jansen