188 search results - page 24 / 38 » Finding Best k Policies |
CIDR
2007
13 years 11 months ago
2007
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines n...
FSTTCS
2006
Springer
14 years 1 months ago
2006
Springer
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
ALMOB
2006
13 years 10 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Manually labeled landmark sets are often required as in-
puts for landmark-based image registration. Identifying an
optimal subset of landmarks from a training dataset may be
us...
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...