Sciweavers

840 search results - page 56 / 168
» The Complexity of the Extended GCD Problem
Sort
View
CGVR
2006
13 years 9 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
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
COMGEO
2008
ACM
13 years 7 months ago
Decomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
Stefan Gerdjikov, Alexander Wolff
IPSN
2005
Springer
14 years 1 months ago
Maximizing system lifetime in wireless sensor networks
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
Qunfeng Dong
CEC
2007
IEEE
14 years 2 months ago
Evolving tiles for automated self-assembly design
Abstract— Self-assembly is a distributed, asynchronous mechanism that is pervasive across natural systems where hierarchical complex structures are built from the bottom-up. The ...
Germán Terrazas, Marian Gheorghe, Graham Ke...