2107 search results - page 6 / 422 » Computing Small Search Numbers in Linear Time |
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
OPODIS
2008
13 years 9 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
ACIVS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...