Sciweavers

2485 search results - page 334 / 497
» Time Bounded Frequency Computations
Sort
View
MOBICOM
2010
ACM
13 years 8 months ago
The spaces between us: setting and maintaining boundaries in wireless spectrum access
Guardbands are designed to insulate transmissions on adjacent frequencies from mutual interference. As more devices in a given area are packed into orthogonal wireless channels, c...
Lei Yang, Ben Y. Zhao, Haitao Zheng
WONS
2005
IEEE
14 years 1 months ago
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
Alexander Kesselman, Dariusz R. Kowalski
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
13 years 10 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 2 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra