Sciweavers

140 search results - page 20 / 28
» Practical Suffix Tree Construction
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 1 months ago
A Simple Optimal Representation for Balanced Parentheses
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...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
WSCG
2004
152views more  WSCG 2004»
13 years 9 months ago
Interactive Solid Texturing using Point-based Multiresolution Representations
This paper presents an interactive environment for texturing surfaces of arbitrary 3D objects. By uniquely using solid textures and applying them to the surface, we do not require...
Patrick Reuter, Benjamin Schmitt, Christophe Schli...
DAC
2011
ACM
12 years 7 months ago
Fault-tolerant 3D clock network
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
Chiao-Ling Lung, Yu-Shih Su, Shih-Hsiu Huang, Yiyu...
BMCBI
2006
92views more  BMCBI 2006»
13 years 8 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...
ICALP
2005
Springer
14 years 1 months ago
Hierarchical Group Signatures
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
Mårten Trolin, Douglas Wikström