2191 search results - page 128 / 439 » Improving the Efficiency of Non-Deterministic Computations |
98
Voted
CCR
2008
15 years 26 days ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
ALGORITHMICA
2006
15 years 25 days ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
CSL
2000
Springer
15 years 18 days ago
2000
Springer
This paper introduces a new form of observation distributions for hidden Markov models (HMMs), combining subvector quantization and mixtures of discrete distrib utions. Despite w...
132
Voted
ASPDAC
2010
ACM
14 years 10 months ago
2010
ACM
In this paper, we present a new voltage IR drop analysis approach for large on-chip power delivery networks. The new approach is based on recently proposed sampling based reductio...
114
Voted
ICMCS
2009
IEEE
14 years 10 months ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...