571 search results - page 26 / 115 » Testing homogeneity of a large data set by bootstrapping |
191
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
102
click to vote
ISBI
2004
IEEE
16 years 13 days ago
2004
IEEE
Point Distribution Modelling (PDM) is an efficient generative technique that can be used to incorporate statistical shape priors into image analysis methods like Active Shape Mode...
83
Voted
IMR
2004
Springer
15 years 5 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
120
click to vote
FQAS
2004
Springer
15 years 3 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...