16430 search results - page 375 / 3286 » On Computable Tree Functions |
247
Voted
ICSE
2003
IEEE-ACM
16 years 20 days ago
2003
IEEE-ACM
Functional requirements contain, and systems exhibit, the behavior summarized below.Despite the advances in software engineering since 1968, how to go from a set of functional req...
201
Voted
STACS
2007
Springer
16 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
228
click to vote
FCT
2003
Springer
16 years 21 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
222
Voted
ISMB
1994
15 years 8 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
213
click to vote
SIGGRAPH
1992
ACM
15 years 11 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...