Sciweavers

5995 search results - page 911 / 1199
» Algorithmic Game Theory
Sort
View
136
Voted
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 9 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
ECML
1993
Springer
15 years 9 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
CONEXT
2007
ACM
15 years 9 months ago
Rethinking internet traffic management: from multiple decompositions to a practical protocol
In the Internet today, traffic management spans congestion control (at end hosts), routing protocols (on routers), and traffic engineering (by network operators). Historically, th...
Jiayue He, Martin Suchara, Ma'ayan Bresler, Jennif...
ICPR
2010
IEEE
15 years 9 months ago
Monogenic Binary Pattern (MBP): A Novel Feature Extraction and Representation Model for Face Recognition
A novel feature extraction method, namely monogenic binary pattern (MBP), is proposed in this paper based on the theory of monogenic signal analysis, and the histogram of MBP (HMB...
Meng Yang, Lei Zhang, Lin Zhang, David Zhang
DAC
2010
ACM
15 years 9 months ago
Lattice-based computation of Boolean functions
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
Mustafa Altun, Marc D. Riedel