Sciweavers

680 search results - page 21 / 136
» A randomized embedding algorithm for trees
Sort
View
SIGMETRICS
2009
ACM
149views Hardware» more  SIGMETRICS 2009»
15 years 7 months ago
On the treeness of internet latency and bandwidth
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 3 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 5 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ECCV
2006
Springer
16 years 3 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
CIKM
2006
Springer
15 years 5 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...