Sciweavers

316 search results - page 22 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
COMPGEOM
2007
ACM
15 years 1 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
TNN
1998
89views more  TNN 1998»
14 years 9 months ago
Fast training of recurrent networks based on the EM algorithm
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
Sheng Ma, Chuanyi Ji
98
Voted
ICML
2005
IEEE
15 years 10 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
DOLAP
2006
ACM
15 years 3 months ago
Pre-aggregation with probability distributions
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
Igor Timko, Curtis E. Dyreson, Torben Bach Pederse...