Sciweavers

498 search results - page 27 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
CGVR
2006
14 years 11 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
TIT
2010
122views Education» more  TIT 2010»
14 years 4 months ago
Biological information as set-based complexity
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
David J. Galas, Matti Nykter, Gregory W. Carter, N...
SCIA
2005
Springer
174views Image Analysis» more  SCIA 2005»
15 years 3 months ago
Object Localization with Boosting and Weak Supervision for Generic Object Recognition
Abstract. This paper deals, for the first time, with an analysis of localization capabilities of weakly supervised categorization systems. Most existing categorization approaches ...
Andreas Opelt, Axel Pinz
CSR
2011
Springer
14 years 1 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
INFSOF
1998
78views more  INFSOF 1998»
14 years 9 months ago
Program slices as an abstraction for cohesion measurement
Slices as an Abstraction for Cohesion Measurement Linda M. Ott Michigan Technological University James M. Bieman Colorado State University The basis for measuring many attributes ...
Linda M. Ott, James M. Bieman