Sciweavers

54 search results - page 3 / 11
» On Approximating the Entropy of Polynomial Mappings
Sort
View
FPL
2004
Springer
103views Hardware» more  FPL 2004»
14 years 15 days ago
Automating Optimized Table-with-Polynomial Function Evaluation for FPGAs
Abstract. Function evaluation is at the core of many compute-intensive applications which perform well on reconfigurable platforms. Yet, in order to implement function evaluation ...
Dong-U Lee, Oskar Mencer, David J. Pearce, Wayne L...
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
14 years 4 months ago
Approximation algorithm for the temperature-aware scheduling problem
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
Sushu Zhang, Karam S. Chatha
HYBRID
2005
Springer
14 years 19 days ago
Polynomial Stochastic Hybrid Systems
This paper deals with polynomial stochastic hybrid systems (pSHSs), which generally correspond to stochastic hybrid systems with polynomial continuous vector fields, reset maps, a...
João P. Hespanha
IVC
2000
179views more  IVC 2000»
13 years 7 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
JGTOOLS
2008
109views more  JGTOOLS 2008»
13 years 7 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg