Sciweavers

149 search results - page 23 / 30
» The Derivational Complexity Induced by the Dependency Pair M...
Sort
View
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
PRL
2007
146views more  PRL 2007»
13 years 6 months ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...
ICSEA
2006
IEEE
14 years 1 months ago
Enforcing Interaction Properties in AOSD-Enabled Systems
The construction and maintenance of large and complex software systems depend on the existence of global principles describing the structure and the interaction among its various ...
Constantin Serban, Shmuel S. Tyszberowicz
CVPR
2008
IEEE
14 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
BMCBI
2011
13 years 2 months ago
Using Stochastic Causal Trees to Augment Bayesian Networks for Modeling eQTL Datasets
Background: The combination of genotypic and genome-wide expression data arising from segregating populations offers an unprecedented opportunity to model and dissect complex phen...
Kyle C. Chipman, Ambuj K. Singh