Sciweavers

1887 search results - page 332 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICIP
2002
IEEE
14 years 9 months ago
A new and simple shape descriptor based on a non-parametric multiscale model
In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed sha...
Max Mignotte
ICDE
1998
IEEE
187views Database» more  ICDE 1998»
14 years 9 months ago
Mining Optimized Association Rules with Categorical and Numeric Attributes
?Mining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a ...
Rajeev Rastogi, Kyuseok Shim
WWW
2004
ACM
14 years 8 months ago
FADA: find all distinct answers
The wealth of information available on the web makes it an attractive resource for seeking quick answers. While web-based question answering becomes an emerging topic in recent ye...
Hui Yang, Tat-Seng Chua
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 8 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
14 years 7 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi