14078 search results - page 76 / 2816 » Design and Analysis of Computer Algorithms |
141
Voted
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
133
Voted
DAC
2006
ACM
16 years 3 months ago
2006
ACM
With increasing aggregate off-chip bandwidths exceeding terabits/second (Tb/s), the power dissipation is a serious design consideration. Additionally, design of I/O links is const...
117
click to vote
ICCNMC
2005
Springer
15 years 8 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
113
click to vote
ICDAR
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
105
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...