1026 search results - page 76 / 206 » On Finding Minimal w-cutset |
187
click to vote
ICPR
2000
IEEE
16 years 7 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...
173
click to vote
WWW
2001
ACM
16 years 7 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 ...
172
click to vote
CHI
2007
ACM
16 years 7 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 ...
191
click to vote
MOBISYS
2006
ACM
16 years 6 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...
162
click to vote
ICC
2007
IEEE
16 years 1 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...