Sciweavers

1832 search results - page 48 / 367
» Querying RDF Data Using A Multigraph-based Approach
Sort
View
WWW
2006
ACM
16 years 3 months ago
Time-dependent semantic similarity measure of queries using historical click-through data
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of clickthrough data logged by Web search engines, which record the...
Qiankun Zhao, Steven C. H. Hoi, Tie-Yan Liu, Soura...
WIDM
2003
ACM
15 years 7 months ago
Answering imprecise database queries: a novel approach
A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfa...
Ullas Nambiar, Subbarao Kambhampati
DATESO
2009
101views Database» more  DATESO 2009»
15 years 11 days ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
202
Voted
ESWS
2011
Springer
14 years 6 months ago
FedX: A Federation Layer for Distributed Query Processing on Linked Open Data
Driven by the success of the Linked Open Data initiative today’s Semantic Web is best characterized as a Web of interlinked datasets. Hand in hand with this structure new challen...
Andreas Schwarte, Peter Haase, Katja Hose, Ralf Sc...
SIGIR
2012
ACM
13 years 5 months ago
Mining query subtopics from search log data
Most queries in web search are ambiguous and multifaceted. Identifying the major senses and facets of queries from search log data, referred to as query subtopic mining in this pa...
Yunhua Hu, Ya-nan Qian, Hang Li, Daxin Jiang, Jian...