Sciweavers

10988 search results - page 191 / 2198
» Algorithmic Folding Complexity
Sort
View
ICML
2007
IEEE
16 years 4 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
140
Voted
RSFDGRC
2005
Springer
208views Data Mining» more  RSFDGRC 2005»
15 years 9 months 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
126
Voted
AMC
2007
114views more  AMC 2007»
15 years 3 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty
102
Voted
ICRA
2007
IEEE
126views Robotics» more  ICRA 2007»
15 years 10 months ago
A Force-Feedback Algorithm for Adaptive Articulated-Body Dynamics Simulation
— This paper introduces a novel algorithm for haptic interaction with an adaptive simulation of articulated-body dynamics. Our algorithm has a multi-threaded structure, which all...
Sandy Morin, Stephane Redon
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
15 years 3 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang