Sciweavers

1402 search results - page 40 / 281
» Sparse-Memory Graph Search
Sort
View
WWW
2008
ACM
15 years 10 months ago
Sailer: an effective search engine for unified retrieval of heterogeneous xml and web documents
This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data. We propose an effective search engine called Sailer to adaptively and versa...
Guoliang Li, Jianhua Feng, Jianyong Wang, Xiaoming...
EVOW
2007
Springer
15 years 4 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
JCO
1998
136views more  JCO 1998»
14 years 9 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
15 years 3 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
CORR
2012
Springer
272views Education» more  CORR 2012»
13 years 5 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...