5084 search results - page 312 / 1017 » Proving Possibility Properties |
189
click to vote
JSAC
2007
15 years 7 months ago
2007
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
214
click to vote
NN
2000
Springer
15 years 7 months ago
2000
Springer
Local minima and plateaus pose a serious problem in learning of neural networks. We investigate the hierarchical geometric structure of the parameter space of three-layer perceptr...
217
click to vote
DGCI
2005
Springer
16 years 29 days ago
2005
Springer
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
276
click to vote
CC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
216
Voted
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...