2143 search results - page 147 / 429 » corr 2010 |
89
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
116
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fa...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
92
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page fra...