Sciweavers

516 search results - page 76 / 104
» Retroactive answering of search queries
Sort
View
LREC
2010
123views Education» more  LREC 2010»
15 years 3 months ago
Querying Diverse Treebanks in a Uniform Way
This paper presents a system for querying treebanks in a uniform way. The system is able to work with both dependency and constituency based treebanks in any language. We demonstr...
Jan Stepánek, Petr Pajas
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
14 years 11 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
CIKM
2009
Springer
15 years 8 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
LREC
2008
115views Education» more  LREC 2008»
15 years 3 months ago
Evaluating Robustness Of A QA System Through A Corpus Of Real-Life Questions
This paper presents the sequential evaluation of the question answering system SQuaLIA. This system is based on the same sequential process as most statistical question answering ...
Laurianne Sitbon, Patrice Bellot, Philippe Blache
WWW
2011
ACM
14 years 8 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...