Sciweavers

10988 search results - page 83 / 2198
» Algorithmic Folding Complexity
Sort
View
SODA
1998
ACM
71views Algorithms» more  SODA 1998»
13 years 11 months ago
On the Distributed Complexity of Computing Maximal Matchings
Michal Hanckowiak, Michal Karonski, Alessandro Pan...
DIALM
2011
ACM
274views Algorithms» more  DIALM 2011»
13 years 1 months ago
Low complexity set reconciliation using Bloom filters
Magnus Skjegstad, Torleiv Maseng
SODA
2012
ACM
199views Algorithms» more  SODA 2012»
12 years 19 days ago
On the communication and streaming complexity of maximum bipartite matching
Ashish Goel, Michael Kapralov, Sanjeev Khanna
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 10 months ago
On the complexity of communication complexity
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...
Eyal Kushilevitz, Enav Weinreb
ICIAP
2001
Springer
14 years 2 months ago
Neural Network Analysis of MINERVA Scene Analysis Benchmark
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...
Markos Markou, Sameer Singh, Mona Sharma