620 search results - page 40 / 124 » A Simple and Fast Min-cut Algorithm |
118
Voted
SIAMSC
2008
15 years 2 months ago
2008
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
100
Voted
WWW
2009
ACM
16 years 3 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
137
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
116
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
129
click to vote
DAC
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...