Sciweavers

44 search results - page 3 / 9
» A sparse algorithm for dense optimal transport
Sort
View
ICCV
2009
IEEE
13 years 2 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
ICTAI
2009
IEEE
13 years 11 months ago
A Multi-objective Genetic Algorithm for Community Detection in Networks
A multiobjective genetic algorithm to uncover community structure in complex network is proposed. The algorithm optimizes two objective functions able to identify densely connecte...
Clara Pizzuti
WCNC
2008
IEEE
13 years 11 months ago
A Density Adaptive Routing Protocol for Large-Scale Ad Hoc Networks
Abstract—Position-based routing protocols use location information to refine the traditional packet flooding method in mobile ad hoc networks. They mainly focus on densely and ...
Zhizhou Li, Yaxiong Zhao, Yong Cui, Dong Xiang
IDA
2002
Springer
13 years 4 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
FIMI
2003
146views Data Mining» more  FIMI 2003»
13 years 5 months ago
Mining Frequent Itemsets using Patricia Tries
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
Andrea Pietracaprina, Dario Zandolin