Sciweavers

707 search results - page 81 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
ICIP
2006
IEEE
14 years 9 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»
14 years 9 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
ICML
2001
IEEE
14 years 8 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 8 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
MFCS
2009
Springer
14 years 2 months ago
Synchronization of Regular Automata
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
Didier Caucal