1439 search results - page 11 / 288 » Fast approximation of centrality |
213
Voted
ICDE
2002
IEEE
16 years 4 months ago
2002
IEEE
124
Voted
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
104
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
83
Voted
EOR
2002
15 years 2 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
136
click to vote
SSDBM
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...