3281 search results - page 482 / 657 » Bases for parametrized iterativity |
ICC
2000
IEEE
15 years 6 months ago
2000
IEEE
—In this paper, we propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorithms with a structure similar to that of the well-known algorit...
130
click to vote
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
The proliferation of the World Wide Web has brought information retrieval (IR) techniques to the forefront of search technology. To the average computer user, “searching” now ...
113
click to vote
KDD
1998
ACM
15 years 6 months ago
1998
ACM
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
120
click to vote
LCTRTS
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
ICCAD
1996
IEEE
15 years 6 months ago
1996
IEEE
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...