2924 search results - page 256 / 585 » Lower Bounds in Distributed Computing |
138
Voted
TWC
2008
15 years 3 months ago
2008
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
201
click to vote
ICTAI
2003
IEEE
15 years 9 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
120
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
140
click to vote
IMCSIT
2010
15 years 1 months ago
2010
The paper presents an extended version of the SuperMatrix system -- a general tool supporting automatic acquisition of lexical semantic relations from corpora. Extensions focus mai...
111
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a novel protocol for restructuring a treebased overlay network in response to the workload of the application running over it. Through low-cost restructuring operations...