Sciweavers

2031 search results - page 165 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
DCC
2001
IEEE
15 years 9 months ago
On Zador's Entropy-Constrained Quantization Theorem
Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorith...
Robert M. Gray, Jia Li
COCOON
2009
Springer
15 years 4 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
SIGIR
2006
ACM
15 years 4 months ago
Theoretical benchmarks of XML retrieval
This poster investigates the use of theoretical benchmarks to describe the matching functions of XML retrieval systems and the properties of specificity and exhaustivity in XML r...
Tobias Blanke, Mounia Lalmas
RECOMB
2004
Springer
15 years 10 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
ISLPED
2005
ACM
96views Hardware» more  ISLPED 2005»
15 years 3 months ago
Region-level approximate computation reuse for power reduction in multimedia applications
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
Xueqi Cheng, Michael S. Hsiao