Sciweavers

2018 search results - page 254 / 404
» Code Normal Forms
Sort
View
99
Voted
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
15 years 3 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
SPIESR
2000
104views Database» more  SPIESR 2000»
15 years 3 months ago
Feature localization and search by object model under illumination change
Color object recognition methods that are based on image retrieval algorithms can handle changes of illumination via image normalization, e.g. simple color-channel-normalization1 ...
Mark S. Drew, Zinovi Tauber, Ze-Nian Li
UAI
2000
15 years 3 months ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
128
Voted
DAGSTUHL
1996
15 years 3 months ago
Pragmatics of Type-Directed Partial Evaluation
Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...
Olivier Danvy
118
Voted
UAI
1993
15 years 3 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney