1026 search results - page 76 / 206 » On Finding Minimal w-cutset |
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
WWW
2001
ACM
15 years 10 months ago
2001
ACM
Recent research has shown that server-driven protocols for achieving cache consistency in wide-area network services can perform significantly better than traditional consistency ...
CHI
2007
ACM
15 years 10 months ago
2007
ACM
We present an empirical study of teams that revealed the amount of extraneous individual work needed to enable collaboration: finding references to other people, finding files to ...
88
Voted
MOBISYS
2006
ACM
15 years 9 months ago
2006
ACM
Multihop wireless mesh networks can provide Internet access over a wide area with minimal infrastructure expenditure. In this work, we present a measurement driven deployment stra...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...