Sciweavers

2412 search results - page 65 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ICASSP
2008
IEEE
14 years 5 months ago
Low-complexity receivers for multiuser detection with an unknown number of active users
In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user...
Daniele Angelosante, Ezio Biglieri
COLT
2005
Springer
14 years 4 months ago
Analysis of Perceptron-Based Active Learning
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
Sanjoy Dasgupta, Adam Tauman Kalai, Claire Montele...
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
14 years 2 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
JELIA
1990
Springer
14 years 3 months ago
Awareness, Negation and Logical Omniscience
General Epistemic Logics suffer from the problem of logical omniscience, which is that an agent's knowledge and beliefs are closed under implication. There have been many att...
Zhisheng Huang, Karen L. Kwast
AAAI
1990
14 years 10 days ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan