3758 search results - page 478 / 752 » A Complete Subsumption Algorithm |
175
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
197
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
186
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
201
click to vote
GCB
2004
Springer
15 years 10 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
160
click to vote
DAS
2006
Springer
15 years 10 months ago
2006
Springer
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding...