2944 search results - page 214 / 589 » Improving Bound Propagation |
164
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
Kahn process networks (KPNs) are a programming paradigm suitable for streaming-based multimedia and signal-processing applications. We discuss the execution of KPNs, and the criter...
143
click to vote
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
181
click to vote
ICALP
1999
Springer
15 years 10 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
155
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
141
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...