2283 search results - page 449 / 457 » Bounds of Graph Characteristics |
156
click to vote
CPM
2004
Springer
15 years 7 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
120
click to vote
TACAS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
139
click to vote
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
115
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
128
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...