Sciweavers

1554 search results - page 144 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
CGVR
2006
15 years 4 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
121
Voted
NICSO
2010
Springer
15 years 10 months ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto
SAC
2010
ACM
15 years 10 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato
124
Voted
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
15 years 7 months ago
New efficient algorithms for computing effective capacitance
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
Andrew B. Kahng, Sudhakar Muddu
136
Voted
COMCOM
2004
84views more  COMCOM 2004»
15 years 3 months ago
A self-extracting accurate modeling for bounded-delay video services
This article proposes the XGOP-B deterministic traffic model for MPEG video services requiring strict bounds on the quality of service provided by the network. The XGOP-B model ta...
Marcelo Dias de Amorim, Otto Carlos Muniz Bandeira...