Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
16,834
The Semantics Of Constraint Logic Programs
- JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract
-
Cited by 872 (14 self)
- Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
Dynamic programming algorithm optimization for spoken word recognition
- IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING
, 1978
"... This paper reports on an optimum dynamic programming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization is given using timewarping function. Then, two time-normalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract
-
Cited by 788 (3 self)
- Add to MetaCart
words in different The effective slope constraint characteristic is qualitatively analyzed, and the optimum slope constraint condition is determined through experiments. The optimized algorithm is then extensively subjected to experimentat comparison with various DP-algorithms, previously applied
A learning algorithm for Boltzmann machines
- Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract
-
Cited by 584 (13 self)
- Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract
-
Cited by 547 (12 self)
- Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized
Optimization of Conditional Value-At-Risk.
- The Journal of Risk,
, 2000
"... Abstract In an intensifying international competition banks are forced to place increased emphasis on enterprise wide risk-/return management. Financial risks have to be limited and managed from a bank wide portfolio perspective. Risk management requirements have to be met from an internal as well ..."
Abstract
-
Cited by 426 (26 self)
- Add to MetaCart
as from a regulatory point of view. Banks need to maximize their expected returns under these constraints. This leads to a generalized portfolio optimization problem under different capital restrictions. We pursue a two-step Risk-/Return Management Approach ("RRM-Approach")
A filtering algorithm for constraints of difference in CSPs
- Proceedings of AAAI’94, the 12th (US) National Conference on Artificial Intelligence
, 1994
"... Abstract Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. They are defined on a subset of variables by a set of tuples for which the values occuring in the same tuple are ..."
Abstract
-
Cited by 378 (6 self)
- Add to MetaCart
are all different. In this paper, a new filtering algorithm for these constraints is presented. It achieves the generalized arc-consistency condition for these non-binary constraints. It is based on matching theory and its complexity is low. In fact, for a constraint defined on a subset of p variables
Data Exchange: Semantics and Query Answering
- In ICDT
, 2003
"... Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query answe ..."
Abstract
-
Cited by 427 (41 self)
- Add to MetaCart
answering in the context of data exchange. These issues arise because, given a source instance, there may be many target instances that satisfy the constraints of the data exchange problem. We give an algebraic specification that selects, among all solutions to the data exchange problem, a special class
Discriminative probabilistic models for relational data
, 2002
"... In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, igno ..."
Abstract
-
Cited by 415 (12 self)
- Add to MetaCart
, ignoring the correlations between them. Recently, Probabilistic Relational Models, a relational version of Bayesian networks, were used to define a joint probabilistic model for a collection of related entities. In this paper, we present an alternative framework that builds on (conditional) Markov networks
Concurrent Constraints Conditional-Branching Timed Interactive Scores
, 2010
"... Multimedia scenarios have multimedia content and interactive events associated with computer programs. Interactive Scores (IS) is a formalism to represent such scenarios by temporal objects, temporal relations (TRs) and interactive events. IS describe TRs, but IS cannot represent TRs together with c ..."
Abstract
- Add to MetaCart
with conditional branching. We propose a model for conditional branching timed IS in the Nondeterministic Timed Concurrent Constraint (ntcc) calculus. We ran a prototype of our model in Ntccrt (a real-time capable interpreter for ntcc) and the response time was acceptable for real-time interaction. An advantage
Visual strength as the constraint condition in artificial grammar learning
"... Previous research using the chain of compound letters as letter strings in artificial grammar learning (AGL) suggested that visual saliency known as global precedence influenced the extent of learning. In this study the luminance of letter strings in the learning phase was manipulated to investigate ..."
Abstract
- Add to MetaCart
to investigate the effect of visual input on AGL regardless of top down attention control. As a result, participants assigned to the low luminance condition were not able to learn any grammar even though they could percept letter strings in the learning phase. This finding suggested that AGL is influenced
Results 1 - 10
of
16,834
