Sciweavers

1143 search results - page 70 / 229
» Querying Probabilistic Information Extraction
Sort
View
109
Voted
CIKM
2009
Springer
15 years 4 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 4 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
96
Voted
CIKM
2005
Springer
15 years 6 months ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
111
Voted
SIGIR
2003
ACM
15 years 6 months ago
A personalised information retrieval tool
Due to both the size and growth of the internet, new tools are needed to assist with the finding and extraction of very specific resources relevant to a user's task. Previous...
Innes Martin, Joemon M. Jose
IPM
2007
182views more  IPM 2007»
15 years 17 days ago
A probabilistic music recommender considering user opinions and audio features
A recommender system has an obvious appeal in an environment where the amount of on-line information vastly outstrips any individual’s capability to survey. Music recommendation...
Qing Li, Sung-Hyon Myaeng, Byeong Man Kim