614 search results - page 28 / 123 » Computational Complexity of Multi-way, Dataflow Constraint P... |
106
click to vote
AGP
1999
IEEE
15 years 3 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
CVPR
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...
RECOMB
2008
Springer
15 years 11 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
AAAI
2008
15 years 1 months ago
2008
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
102
click to vote
CP
1997
Springer
15 years 3 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...