Sciweavers

19130 search results - page 162 / 3826
» Modelling multi-path problems
Sort
View
AMC
2005
112views more  AMC 2005»
15 years 6 months ago
Stieltjes moment problem via fractional moments
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
AICOM
2004
92views more  AICOM 2004»
15 years 6 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
BMCBI
2011
15 years 1 months ago
A discriminative method for family-based protein remote homology detection that combines inductive logic programming and proposi
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
Juliana S. Bernardes, Alessandra Carbone, Gerson Z...
ENDM
2000
174views more  ENDM 2000»
15 years 6 months ago
Hybrid Constraints in Automated Model Synthesis and Model Processing
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
Klaus-Ulrich Leweling, Benno Stein
ICML
2005
IEEE
16 years 7 months ago
Object correspondence as a machine learning problem
We propose machine learning methods for the estimation of deformation fields that transform two given objects into each other, thereby establishing a dense point to point correspo...
Bernhard Schölkopf, Florian Steinke, Volker B...