Sciweavers

2366 search results - page 99 / 474
» Mapping time
Sort
View
SIGGRAPH
1993
ACM
14 years 1 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max
ICCAD
2004
IEEE
158views Hardware» more  ICCAD 2004»
14 years 6 months ago
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
Deming Chen, Jason Cong
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
13 years 1 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
WINET
2002
80views more  WINET 2002»
13 years 9 months ago
A Homogeneous PCS network with Markov Call Arrival Process and Phase Type Cell Residence Time
In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow...
Attahiru Sule Alfa, Wei Li
JUCS
2006
112views more  JUCS 2006»
13 years 9 months ago
A Multi-objective Genetic Approach to Mapping Problem on Network-on-Chip
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi