Sciweavers

2778 search results - page 364 / 556
» Limit complexities revisited
Sort
View
ENC
2004
IEEE
15 years 10 months ago
A New Cache Approach Based on Graph for Web Servers
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
Euloge Edi, Denis Trystram, Jean-Marc Vincent
EUROPAR
2004
Springer
15 years 10 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
FCCM
2004
IEEE
103views VLSI» more  FCCM 2004»
15 years 10 months ago
A Dynamically-Reconfigurable, Power-Efficient Turbo Decoder
The development of turbo codes has allowed for nearShannon limit information transfer in modern communication systems. Although turbo decoding is viewed as superior to alternate d...
Jian Liang, Russell Tessier, Dennis Goeckel
CONCUR
2006
Springer
15 years 10 months ago
Event Structure Semantics for Nominal Calculi
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
Roberto Bruni, Hernán C. Melgratti, Ugo Mon...
FPGA
2004
ACM
128views FPGA» more  FPGA 2004»
15 years 10 months ago
Incremental physical resynthesis for timing optimization
This paper presents a new approach to timing optimization for FPGA designs, namely incremental physical resynthesis, to answer the challenge of effectively integrating logic and p...
Peter Suaris, Lung-Tien Liu, Yuzheng Ding, Nan-Chi...