Sciweavers

3713 search results - page 280 / 743
» Quantum Information Theory
Sort
View
FOGA
2011
14 years 4 months 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
135
Voted
SIGMOD
2012
ACM
278views Database» more  SIGMOD 2012»
13 years 3 months ago
Differential privacy in data publication and analysis
Data privacy has been an important research topic in the security, theory and database communities in the last few decades. However, many existing studies have restrictive assumpt...
Yin Yang, Zhenjie Zhang, Gerome Miklau, Marianne W...
129
Voted
CIKM
2005
Springer
15 years 6 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
114
Voted
ALT
2003
Springer
15 years 9 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
106
Voted
CAI
2011
Springer
14 years 4 months ago
Theme and Variations on the Concatenation Product
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
Jean-Éric Pin