693 search results - page 91 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
JAR
1998
13 years 7 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...
BMCBI
2007
13 years 8 months ago
2007
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...