Sciweavers

35 search results - page 4 / 7
» Fast discovery of connection subgraphs
Sort
View
WEBI
2010
Springer
13 years 7 months ago
MQuery: Fast Graph Query via Semantic Indexing for Mobile Context
Mobile is becoming a ubiquitous platform for context-aware intelligent computing. One fundamental but usually ignored issue is how to efficiently manage (e.g., index and query) the...
Yuan Zhang, Ning Zhang, Jie Tang, Jinghai Rao, Wen...
PIMRC
2008
IEEE
14 years 4 months ago
Multi-hop discovery of Candidate Access Routers (MHD-CAR) for fast moving mobile nodes
—Seamless IP mobility protocols like Fast Mobile IPv6 (FMIPv6) requires the knowledge of candidate access routers, to which the mobile node will hand over its connection to, well...
Faqir Zarrar Yousaf, Christian Muller, Christian W...
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 11 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
DILS
2006
Springer
14 years 1 months ago
Link Discovery in Graphs Derived from Biological Databases
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
Petteri Sevon, Lauri Eronen, Petteri Hintsanen, Ki...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 10 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan