Sciweavers

6142 search results - page 373 / 1229
» The Complexity of Partition Functions
Sort
View
152
Voted
ISSS
1999
IEEE
109views Hardware» more  ISSS 1999»
15 years 11 months ago
Loop Alignment for Memory Accesses Optimization
Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criter...
Antoine Fraboulet, Guillaume Huard, Anne Mignotte
IPPS
1998
IEEE
15 years 11 months ago
Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
David Coudert, Afonso Ferreira, Xavier Muño...
ADL
1997
Springer
125views Digital Library» more  ADL 1997»
15 years 11 months ago
Error Tolerant Document Structure Analysis
Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text document...
Bertin Klein, Peter Fankhauser
PARLE
1992
15 years 10 months ago
Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems
Complex and data-intensive database queries mandate parallel processing strategies to achieve sufficiently short response times. In praxis, parallel database processing is mostly b...
Robert Marek, Erhard Rahm
PODC
2010
ACM
15 years 10 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer