10608 search results - page 312 / 2122 » Complexity of O'Hara's Algorithm |
105
click to vote
WIOPT
2010
IEEE
14 years 11 months ago
2010
IEEE
—Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform thei...
86
Voted
ICFEM
2009
Springer
14 years 10 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
135
Voted
SIAMCOMP
2010
14 years 7 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
83
Voted
ICIP
1998
IEEE
16 years 2 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
116
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...