Sciweavers

1983 search results - page 203 / 397
» Competitive graph searches
Sort
View
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 1 days ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
CVPR
2010
IEEE
15 years 11 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
GLOBECOM
2009
IEEE
15 years 9 months ago
Graph-Based Approach for Enhancing Capacity and Fairness in Wireless Mesh Networks
—Wireless Mesh Networks have been an emerging technology in the past years. They are mainly used for providing last-mile broadband wireless access. It is then highly recommended ...
Salim Nahle, Naceur Malouch
AUSDM
2007
Springer
164views Data Mining» more  AUSDM 2007»
15 years 9 months ago
SemGrAM - Integrating Semantic Graphs into Association Rule Mining
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
John F. Roddick, Peter Fule
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 9 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner