1418 search results - page 96 / 284 » Schema polynomials and applications |
140
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
133
click to vote
ISAAC
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
156
click to vote
CHES
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We describe an implementation of the PASS polynomial authentication and signature scheme [5, 6] that is suitable for use in highly constrained environments such as SmartC...
150
click to vote
FPLE
1995
15 years 9 months ago
1995
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
175
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...