Sciweavers

4255 search results - page 174 / 851
» On Learning Boolean Functions
Sort
View
ICML
1990
IEEE
15 years 2 months ago
Average Case Analysis of Conjunctive Learning Algorithms
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the...
Michael J. Pazzani, Wendy Sarrett
ECTEL
2006
Springer
15 years 1 months ago
Language Technology for eLearning
Abstract. Given the huge amount of static and dynamic content created for eLearning tasks, the major challenge for extending their use is to improve the effectiveness of retrieval ...
Paola Monachesi, Lothar Lemnitzer, Kiril Ivanov Si...
ICIP
2006
IEEE
15 years 12 months ago
Supershape Recovery from 3D Data Sets
In this paper, we apply supershapes and R-functions to surface recovery from 3D data sets. Individual supershapes are separately recovered from a segmented mesh. R-functions are u...
Andrei V. Gribok, Frédéric Truchetet...
ICDE
1998
IEEE
121views Database» more  ICDE 1998»
15 years 11 months ago
Fuzzy Triggers: Incorporating Imprecise Reasoning into Active Databases
Traditional Event-Condition-Action triggers (active database rules) include a Boolean predicate as a trigger condition. We propose fuzzy triggers whereby fuzzy inference is utiliz...
Antoni Wolski, Tarik Bouaziz
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson