2924 search results - page 127 / 585 » Lower Bounds in Distributed Computing |
109
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
86
Voted
MIDDLEWARE
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
125
Voted
ML
2012
ACM
13 years 8 months ago
2012
ACM
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
67
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
108
click to vote
WAOA
2007
Springer
15 years 6 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...