729 search results - page 135 / 146 » Computing persistent homology |
149
click to vote
SIGGRAPH
1996
ACM
15 years 1 months ago
1996
ACM
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...
APNOMS
2007
Springer
15 years 1 months ago
2007
Springer
Network topology discovery for the large IP networks is a very well studied area of research. Most of the previous work focus on improving the efficiency in terms of time and compl...
GROUP
2007
ACM
15 years 1 months ago
2007
ACM
The tension between privacy and awareness has been a persistent difficulty in distributed environments that support opportunistic and informal interaction. For example, many aware...
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
NSDI
2008
14 years 12 months ago
2008
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...