Sciweavers

60 search results - page 3 / 12
» Context-Aware Object Connection Discovery in Large Graphs
Sort
View
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 7 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
EUROPAR
2007
Springer
13 years 11 months ago
On the Connectivity of Bluetooth-Based Ad Hoc Networks
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracapr...
CVPR
2010
IEEE
13 years 3 months ago
Common visual pattern discovery via spatially coherent correspondences
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
Hairong Liu, Shuicheng Yan
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 3 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
ASUNAM
2010
IEEE
13 years 7 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon