26071 search results - page 5205 / 5215 » Making the |
DIALM
2003
ACM
14 years 1 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...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
DSD
2002
IEEE
14 years 1 months ago
2002
IEEE
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
FUN
2010
Springer
14 years 1 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...