Sciweavers

297 search results - page 16 / 60
» Choosing a Reliable Hypothesis
Sort
View
JMLR
2002
140views more  JMLR 2002»
13 years 9 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
CVPR
2012
IEEE
12 years 10 days ago
Model recommendation for action recognition
Simply choosing one model out of a large set of possibilities for a given vision task is a surprisingly difficult problem, especially if there is limited evaluation data with whi...
Pyry Matikainen, Rahul Sukthankar, Martial Hebert
PET
2004
Springer
14 years 3 months ago
Synchronous Batching: From Cascades to Free Routes
The variety of possible anonymity network topologies has spurred much debate in recent years. In a synchronous batching design, each batch of messages enters the mix network togeth...
Roger Dingledine, Vitaly Shmatikov, Paul F. Syvers...
ICML
2004
IEEE
14 years 10 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
JCC
2008
88views more  JCC 2008»
13 years 10 months ago
A self-organizing algorithm for molecular alignment and pharmacophore development
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...
Deepak Bandyopadhyay, Dimitris K. Agrafiotis