Sciweavers

2814 search results - page 299 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
108
Voted
NIPS
2003
15 years 1 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
104
Voted
DAM
2008
81views more  DAM 2008»
15 years 17 days ago
Random-order bin packing
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
Edward G. Coffman Jr., János Csirik, Lajos ...
81
Voted
TCS
2010
14 years 11 months ago
Active learning in heteroscedastic noise
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
András Antos, Varun Grover, Csaba Szepesv&a...
108
Voted
CINQ
2004
Springer
138views Database» more  CINQ 2004»
15 years 5 months ago
Relevancy in Constraint-Based Subgroup Discovery
This chapter investigates subgroup discovery as a task of constraint-based mining of local patterns, aimed at describing groups of individuals with unusual distributional character...
Nada Lavrac, Dragan Gamberger
105
Voted
TIT
2002
72views more  TIT 2002»
15 years 4 days ago
Principal curves with bounded turn
Principal curves, like principal components, are a tool used in multivariate analysis for ends like feature extraction. Defined in their original form, principal curves need not ex...
S. Sandilya, Sanjeev R. Kulkarni