32545 search results - page 144 / 6509 » Data Structures and Algorithms |
118
click to vote
FIMI
2003
15 years 4 months ago
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
132
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
147
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
100
click to vote
AAAI
2006
15 years 4 months ago
2006
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
175
click to vote
KDD
2007
ACM
16 years 3 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...