Sciweavers

7167 search results - page 255 / 1434
» Answer Set Programming
Sort
View
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
16 years 3 months ago
Efficient Computation of Diverse Query Results
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasund...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 2 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
MFCS
2009
Springer
15 years 9 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan
DOCENG
2009
ACM
15 years 8 months ago
Test collection management and labeling system
In order to evaluate the performance of information retrieval and extraction algorithms, we need test collections. A test collection consists of a set of documents, a clearly form...
Eunyee Koh, Andruid Kerne, Sarah Berry
109
Voted
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 8 months ago
Convergence phases, variance trajectories, and runtime analysis of continuous EDAs
Considering the available body of literature on continuous EDAs, one must state that many important questions are still unanswered, e.g.: How do continuous EDAs really work, and h...
Jörn Grahl, Peter A. N. Bosman, Stefan Minner