Sciweavers

90 search results - page 11 / 18
» Suffix tree construction algorithms on modern hardware
Sort
View
ISCAS
2002
IEEE
94views Hardware» more  ISCAS 2002»
14 years 14 days ago
Minimum power broadcast trees for wireless networks: optimizing using the viability lemma
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all no...
Robert J. Marks II, Arindam Kumar Das, Mohamed A. ...
GIS
2010
ACM
13 years 5 months ago
Natural neighbor interpolation based grid DEM construction using a GPU
With modern LiDAR technology the amount of topographic data, in the form of massive point clouds, has increased dramatically. One of the most fundamental GIS tasks is to construct...
Alex Beutel, Thomas Mølhave, Pankaj K. Agar...
ISMVL
1997
IEEE
82views Hardware» more  ISMVL 1997»
13 years 11 months ago
Finding Composition Trees for Multiple-Valued Functions
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
ISCAS
1995
IEEE
70views Hardware» more  ISCAS 1995»
13 years 11 months ago
Minimum-Cost Bounded-Skew Clock Routing
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST)...
Jason Cong, Cheng-Kok Koh
ISPD
2006
ACM
108views Hardware» more  ISPD 2006»
14 years 1 months ago
Statistical clock tree routing for robustness to process variations
Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufactu...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu