Sciweavers

1983 search results - page 51 / 397
» Competitive graph searches
Sort
View
ICASSP
2009
IEEE
13 years 11 months ago
Spoken dialog strategy based on understanding graph search
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
Yuji Kinoshita, Chiyomi Miyajima, Norihide Kitaoka...
CN
2007
108views more  CN 2007»
13 years 7 months ago
On the peninsula phenomenon in web graph and its implications on web search
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
Tao Meng, Hong-Fei Yan
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 2 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
TKDE
2008
136views more  TKDE 2008»
13 years 7 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 7 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu