Sciweavers

136 search results - page 20 / 28
» On Learning Monotone Boolean Functions
Sort
View
COLT
2006
Springer
13 years 11 months ago
Active Sampling for Multiple Output Identification
We study functions with multiple output values, and use active sampling to identify an example for each of the possible output values. Our results for this setting include: (1) Eff...
Shai Fine, Yishay Mansour
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
IJCAI
1993
13 years 9 months ago
Average-Case Analysis of a Nearest Neighbor Algorithm
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
Pat Langley, Wayne Iba
CISST
2003
88views Hardware» more  CISST 2003»
13 years 9 months ago
Virtual Experts for Imagery Registration and Conflation
The unique human expertise in imagery analysis should be preserved and shared with other imagery analysts to improve image analysis and decision-making. Such knowledge can serve a...
Boris Kovalerchuk, Artemus Harper, Michael Kovaler...
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes