Sciweavers

779 search results - page 99 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
JAIR
2012
254views Hardware» more  JAIR 2012»
13 years 8 months ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...
VLDB
2004
ACM
138views Database» more  VLDB 2004»
15 years 11 months ago
ObjectRank: Authority-Based Keyword Search in Databases
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containin...
Andrey Balmin, Vagelis Hristidis, Yannis Papakonst...
CIKM
2006
Springer
15 years 10 months ago
A system for query-specific document summarization
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
Ramakrishna Varadarajan, Vagelis Hristidis
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
16 years 28 days ago
Modeling and predicting user behavior in sponsored search
Implicit user feedback, including click-through and subsequent browsing behavior, is crucial for evaluating and improving the quality of results returned by search engines. Severa...
Josh Attenberg, Sandeep Pandey, Torsten Suel
ICFP
2008
ACM
16 years 6 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...