779 search results - page 85 / 156 » Algorithms for the Sample Mean of Graphs |
152
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
133
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
132
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...
134
Voted
ACL
1998
15 years 5 months ago
1998
Word sense disambiguation algorithms, with few exceptions, have made use of only one lexical knowledge source. We describe a system which t)erforms word sense disambiguation on al...
175
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...