10146 search results - page 1590 / 2030 » Fast FAST |
273
click to vote
ASPDAC
2005
ACM
15 years 9 months ago
2005
ACM
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...
186
click to vote
ASPDAC
2005
ACM
15 years 9 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
216
click to vote
HIPEAC
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
219
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
239
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...