10988 search results - page 83 / 2198 » Algorithmic Folding Complexity |
99
Voted
SODA
1998
ACM
15 years 3 months ago
1998
ACM
133
Voted
DIALM
2011
ACM
14 years 5 months ago
2011
ACM
SODA
2012
ACM
13 years 4 months ago
2012
ACM
133
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
123
Voted
ICIAP
2001
Springer
15 years 6 months ago
2001
Springer
Scene analysis is an important area of research with the aim of identifying objects and their relationships in natural scenes. MINERVA benchmark has been recently introduced in th...