Sciweavers

29908 search results - page 194 / 5982
» On the complexity of communication complexity
Sort
View
DNA
2011
Springer
213views Bioinformatics» more  DNA 2011»
14 years 6 months ago
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
Robert Brijder, Joris J. M. Gillis, Jan Van den Bu...
ICML
2007
IEEE
16 years 7 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
RSFDGRC
2005
Springer
208views Data Mining» more  RSFDGRC 2005»
16 years 6 hour ago
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
Dan Wu, Cory J. Butz
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 11 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
LICS
2002
IEEE
15 years 11 months ago
The Proof Complexity of Linear Algebra
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
Michael Soltys, Stephen A. Cook