2834 search results - page 205 / 567 » Representing Trees with Constraints |
101
Voted
ECOOP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
102
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
100
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
189
click to vote
ICDE
2004
IEEE
16 years 2 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
112
click to vote
RECOMB
2008
Springer
16 years 1 months ago
2008
Springer
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...