Results 251 to 260 of about 4,792,487 (297)

Structural constraints and neutrality in RNA

1996
Generic properties of neutral networks of RNA secondary structures can be described by means of random graph theory. The success of this approach is dependent on details of the underlying secondary structure. Some of these dependencies are analyzed in this paper.
Ulrike Göbel, Christian V. Forst, Peter Schuster 0002   +2 more
openaire   +3 more sources

Weak continuity with structural constraints

IEEE Transactions on Signal Processing, 1997
Nonlinear regression and nonlinear regularization are two powerful approaches to segmentation and nonlinear filtering. In this correspondence, we propose a hybrid approach that effectively combines the best of both worlds and can be efficiently implemented via the Viterbi algorithm.
Nikos D. Sidiropoulos, John S. Baras, Carlos Alberto Berenstein   +2 more
openaire   +2 more sources

Structural Tractability of Constraint Optimization

2011
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modeling those scenarios where solutions are associated with costs. Within these frameworks, computing an optimal solution (short: MIN problem), enumerating the best K solutions (Top-K), and computing the next solution following one that is
GRECO, Gianluigi, SCARCELLO, Francesco
openaire   +2 more sources

Structural constraints on bimanual movements

Psychological Research, 1993
A theoretical framework is outlined, according to which structural constraints on bimanual movements can at least in part be understood as coupling between parameters of generalized motor programs. This framework provides a conceptual link between reaction-time data from experiments with bimanual responses, successive unimanual responses, and choice ...
openaire   +2 more sources

Random Constraint Satisfaction: Flaws and Structure

Constraints, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh   +4 more
openaire   +3 more sources

Computational Solutions for Structural Constraints

2001
The need to solve structural constraints arises when we investigate computational solutions to the question: "in which logics is a given formula deducible?" This question is posed when one wants to learn the structural permissions for a Categorial Grammar deduction.
openaire   +2 more sources

Structural Constraints for Pose Clustering

1999
This paper describes a structural method for object alignment by pose clustering. The idea underlying pose clustering is to decompose the objects under consideration into k-tuples of primitive parts. By bringing pairs of k-tuples into correspondence, sets of alignment parameters are estimated.
Simon Moss, Edwin R. Hancock
openaire   +1 more source

Constraint Analysis and Structure Identification

1976
Recent developments in establishing a firm conceptual foundation for a systems methodology by Klir (1975) have revealed a differentiation of system definitions in the form of a hierarchy. This paper concentrates on a specific hierarchical level which is concerned with the structure identification problem. It is shown that the application of information
openaire   +2 more sources

Constraint Representations and Structural Tractability

2009
The intractability of the general CSP has motivated the search for restrictions which lead to tractable fragments. One way to achieve tractability is to restrict the structure of the instances. As much of the work in this area arises from similar work on databases it has been a natural assumption that all constraint relations are explicitly represented.
David A. Cohen, Martin James Green, Chris Houghton   +2 more
openaire   +1 more source

Constraints on Structural Descriptions: Local Transformations

SIAM Journal on Computing, 1977
It is very often more convenient and more meaningful to specify a set of structural descriptions analytically rather than generatively, i.e., by specifying a set of constraints each structured description in the set has to satisfy. Peters and Ritchie [7] have shown that if context-sensitive rules are used only for “analysis” then the string language of
Aravind K. Joshi, Leon S. Levy
openaire   +2 more sources