Sciweavers

1236 search results - page 26 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 2 months ago
Configuration Relocation and Defragmentation for Reconfigurable Computing
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
Katherine Compton, James Cooley, Stephen Knol, Sco...
MICRO
2010
IEEE
173views Hardware» more  MICRO 2010»
14 years 7 months ago
Single-Chip Heterogeneous Computing: Does the Future Include Custom Logic, FPGAs, and GPGPUs?
To extend the exponential performance scaling of future chip multiprocessors, improving energy efficiency has become a first-class priority. Single-chip heterogeneous computing ha...
Eric S. Chung, Peter A. Milder, James C. Hoe, Ken ...
TPDS
2008
125views more  TPDS 2008»
14 years 9 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
SAC
2005
ACM
15 years 3 months ago
Avoiding data conversions in embedded media processors
Complex application-specific media instructions and kernels are emulated with simple to implement extended subword instructions. We show that assuming extended register file ent...
Ben H. H. Juurlink, Asadollah Shahbahrami, Stamati...
BIRTHDAY
2008
Springer
14 years 11 months ago
Some Results on the Expressive Power and Complexity of LSCs
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
David Harel, Shahar Maoz, Itai Segall