1542 search results - page 77 / 309 » The metamathematics of random graphs |
CPC
2007
14 years 9 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
AIRS
2006
Springer
15 years 1 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
CCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
FOCM
2007
14 years 9 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...