Sciweavers

33 search results - page 3 / 7
» Canonical Partitions Of Universal Structures
Sort
View
ICALP
2009
Springer
15 years 9 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
VLSID
2005
IEEE
97views VLSI» more  VLSID 2005»
15 years 3 months ago
Q-PREZ: QBF Evaluation Using Partition, Resolution and Elimination with ZBDDs
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
Kameshwar Chandrasekar, Michael S. Hsiao
85
Voted
BMCBI
2004
151views more  BMCBI 2004»
14 years 9 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
105
Voted
IWCIA
2009
Springer
15 years 4 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
MICCAI
2005
Springer
15 years 10 months ago
Brain Surface Parameterization Using Riemann Surface Structure
Abstract. We develop a general approach that uses holomorphic 1forms to parameterize anatomical surfaces with complex (possibly branching) topology. Rather than evolve the surface ...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...