Sciweavers

5832 search results - page 867 / 1167
» Software complexity and maintainability
Sort
View
FSTTCS
2004
Springer
16 years 20 days ago
Genome Halving Problem Revisited
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Max A. Alekseyev, Pavel A. Pevzner
FSTTCS
2004
Springer
16 years 20 days ago
Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
Christof Löding, P. Madhusudan, Olivier Serre
FSTTCS
2004
Springer
16 years 20 days ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
ICESS
2004
Springer
16 years 20 days ago
Relating FFTW and Split-Radix
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
Oleg Kiselyov, Walid Taha
IEAAIE
2004
Springer
16 years 19 days ago
Natural Language Requirements Analysis and Class Model Generation Using UCDA
This paper presents a methodology to automate natural language requirements analysis and class model generation based on the Rational Unified Process (RUP). Use-case language schem...
Dong Liu, Kalaivani Subramaniam, Armin Eberlein, B...