Sciweavers

243 search results - page 34 / 49
» Faceted Wikipedia Search
Sort
View
FOGA
2011
13 years 2 days ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 11 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 3 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
PVLDB
2010
161views more  PVLDB 2010»
13 years 7 months ago
Annotating and Searching Web Tables Using Entities, Types and Relationships
Tables are a universal idiom to present relational data. Billions of tables on Web pages express entity references, attributes and relationships. This representation of relational...
Girija Limaye, Sunita Sarawagi, Soumen Chakrabarti
SIGMOD
2009
ACM
144views Database» more  SIGMOD 2009»
14 years 8 months ago
Do we mean the same?: disambiguation of extracted keyword queries for database search
Users often try to accumulate information on a topic of interest from multiple information sources. In this case a user's informational need might be expressed in terms of an...
Elena Demidova, Irina Oelze, Peter Fankhauser