17789 search results - page 3557 / 3558 » Exceptional Use Cases |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
115
click to vote
DIALM
2003
ACM
15 years 3 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
DIALM
2003
ACM
15 years 3 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
157
click to vote
FUN
2010
Springer
15 years 2 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
113
click to vote
PLDI
1991
ACM
15 years 1 months ago
1991
ACM
o Authors of Extended Abstracts William Pugh Dept. of Computer Science and Institute for Advanced Computer Studies Univ. of Maryland, College Park March 16, 1993 This article stems...