Sciweavers

4255 search results - page 291 / 851
» On Learning Boolean Functions
Sort
View
TCC
2007
Springer
142views Cryptology» more  TCC 2007»
16 years 22 days ago
On Best-Possible Obfuscation
An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-...
Shafi Goldwasser, Guy N. Rothblum
CP
2011
Springer
14 years 6 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
15 years 10 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
ICDE
2003
IEEE
159views Database» more  ICDE 2003»
16 years 8 months ago
Scaling up the ALIAS Duplicate Elimination System
Duplicate elimination is an important stage in integrating data from multiple sources. The challenges involved are finding a robust deduplication function that can identify when t...
Sunita Sarawagi, Alok Kirpal
ICML
2008
IEEE
16 years 7 months ago
Fast Gaussian process methods for point process intensity estimation
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
John P. Cunningham, Krishna V. Shenoy, Maneesh Sah...