1888 search results - page 135 / 378 » Algorithms for Querying by Spatial Structure |
119
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
142
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
149
click to vote
WADS
1997
Springer
15 years 8 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
161
click to vote
DASFAA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
245
click to vote
SYRCODIS
2008
15 years 6 months ago
2008
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...