Sciweavers

420 search results - page 28 / 84
» Search on High Degree Graphs
Sort
View
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
15 years 6 months ago
Searching for Related Objects in Relational Databases
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
Xiaoxin Yin, Jiawei Han, Jiong Yang
97
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 8 days ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
200
Voted
CVPR
2010
IEEE
15 years 2 months ago
Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
Qi Song, Xiaodong Wu, Yunlong Liu, Mona Garvin, Mi...
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
16 years 2 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
AI
2000
Springer
15 years 16 days ago
Using temporal logics to express search control knowledge for planning
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
Fahiem Bacchus, Froduald Kabanza