Sciweavers

2520 search results - page 292 / 504
» The complexity of approximating entropy
Sort
View
EURODAC
1994
IEEE
141views VHDL» more  EURODAC 1994»
15 years 10 months ago
Exact path sensitization in timing analysis
of a direct implementation of this criterion. This paper presents the first critical path finding tool based on the exact criterion. It offers therefore better results in compariso...
R. Peset Llopis
SIGGRAPH
2010
ACM
15 years 10 months ago
Physical reproduction of materials with specified subsurface scattering
We investigate a complete pipeline for measuring, modeling, and fabricating objects with specified subsurface scattering behaviors. The process starts with measuring the scatterin...
Miloš Hašan, Martin Fuchs, Wojciech Matusik, Han...
FSTTCS
1993
Springer
15 years 10 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
META
1992
15 years 10 months ago
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
Maurice Bruynooghe, Gerda Janssens
ALGOSENSORS
2006
Springer
15 years 10 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro