3146 search results - page 428 / 630 » Efficient Consequence Finding |
246
Voted
ICDE
2006
IEEE
16 years 5 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...
212
Voted
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
Most data integration applications require a matching between the schemas of the respective data sets. We show how the existence of duplicates within these data sets can be exploi...
218
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...
147
Voted
MICCAI
2008
Springer
16 years 4 months ago
2008
Springer
We describe an efficient and accurate method for segmenting sets of subcortical structures in 3D MR images of the brain. We first find the approximate position of all the structure...
110
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
This paper describes an efficient method to obtain 3D information from omni images using EPI analysis. Two types of omni cameras are employed to make a spatio-temporal volume, whi...