Sciweavers

4255 search results - page 93 / 851
» On Learning Boolean Functions
Sort
View
CIE
2007
Springer
15 years 4 months ago
Input-Dependence in Function-Learning
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
Sanjay Jain, Eric Martin, Frank Stephan
DAC
2009
ACM
15 years 11 months ago
Nanoscale digital computation through percolation
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
Mustafa Altun, Marc D. Riedel, Claudia Neuhauser
ICALP
2007
Springer
15 years 4 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
SEMWEB
2007
Springer
15 years 4 months ago
Towards Fine-grained Service Matchmaking by Using Concept Similarity
Several description frameworks to semantically describe and match services on the one hand and service requests on the other have been presented in the literature. Many of the curr...
Alberto Fernández, Axel Polleres, Sascha Os...
SSC
2007
Springer
161views Cryptology» more  SSC 2007»
15 years 4 months ago
On Attacks on Filtering Generators Using Linear Subspace Structures
Abstract. The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines some bits from the shift register to create a ke...
Sondre Rønjom, Guang Gong, Tor Helleseth