Sciweavers

2283 search results - page 403 / 457
» Bounds of Graph Characteristics
Sort
View
CP
2000
Springer
14 years 7 days ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
14 years 5 days ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
14 years 4 days ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
STOC
1997
ACM
97views Algorithms» more  STOC 1997»
14 years 2 days ago
Using and Combining Predictors That Specialize
Abstract. We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called “experts.” These simple a...
Yoav Freund, Robert E. Schapire, Yoram Singer, Man...
NN
1997
Springer
174views Neural Networks» more  NN 1997»
14 years 1 days ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani