620 search results - page 29 / 124 » A Simple and Fast Min-cut Algorithm |
104
click to vote
FIMI
2003
15 years 3 months ago
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
120
click to vote
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
167
click to vote
NIPS
2001
15 years 3 months ago
2001
This paper develops a new approach for extremely fast detection in domains where the distribution of positive and negative examples is highly skewed (e.g. face detection or databa...
127
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
112
click to vote
GLVLSI
2006
IEEE
15 years 8 months ago
2006
IEEE
State-space modeling of fully differential Gm-C filters with weak nonlinearities is used to develop a fast algorithm for intermodulation distortion estimation. It results in sim...