SODA
2001
ACM
13 years 11 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
OPODIS
2001
13 years 11 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
NIPS
2001
13 years 11 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
NIPS
2004
13 years 11 months ago
2004
Classification algorithms typically induce population-wide models that are trained to perform well on average on expected future instances. We introduce a Bayesian framework for l...
EUSFLAT
2003
13 years 11 months ago
2003
The paper is devoted to the problems of using the algorithms in expert systems of choice in the investment projects; singularities of such algorithms and their functioning in diff...
ECIR
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We focus on two recently proposed algorithms in the family of “boosting”-based learners for automated text classification, AdaBoost.MH and AdaBoost.MHKR . While the ...