Sciweavers

93 search results - page 4 / 19
» What Makes the Arc-Preserving Subsequence Problem Hard
Sort
View
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 5 months ago
Dimensions of Difficulty in Translating Natural Language into First-Order Logic
In this paper, we present a study of a large corpus of student logic exercises in which we explore the relationship between two distinct measures of difficulty: the proportion of s...
Dave Barker-Plummer, Richard Cox, Robert Dale
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 27 days ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
EUROCRYPT
2006
Springer
13 years 11 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai
SIGMOD
2010
ACM
155views Database» more  SIGMOD 2010»
13 years 5 months ago
Search in social networks with access control
More and more important data is accumulated inside social networks. Limiting the flow of private information across a social network is very important, and most social networks pr...
Truls Amundsen Bjørklund, Michaela Göt...
SIGIR
2011
ACM
12 years 10 months ago
Picasso - to sing, you must close your eyes and draw
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...
Aleksandar Stupar, Sebastian Michel