620 search results - page 30 / 124 » A Simple and Fast Min-cut Algorithm |
229
click to vote
ICDE
1995
IEEE
16 years 3 months ago
1995
IEEE
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
121
click to vote
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
122
click to vote
VTS
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper describes a random jitter measurement technique using simple algorithms and comparator sampling. The approach facilitates using Automated Test Equipment (ATE) to valida...
131
click to vote
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
BILDMED
2008
15 years 3 months ago
2008
We present an algorithm for fast automatic registration of spatially overlapping radiographs. It possesses strong robustness against noise, feature masking and feature displacement...