3088 search results - page 362 / 618 » Online Passive-Aggressive Algorithms |
216
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
188
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
172
click to vote
ISSRE
2006
IEEE
16 years 18 days ago
2006
IEEE
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
223
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
187
click to vote
GI
1999
Springer
15 years 11 months ago
1999
Springer
d Abstract) Friedhelm Meyer auf der Heide Berthold V¨ocking† Matthias Westermann We present a general framework for the development of online algorithms for data manageme...