Sciweavers

1091 search results - page 104 / 219
» Approximation in Databases
Sort
View
EDBT
2006
ACM
182views Database» more  EDBT 2006»
16 years 6 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
DIS
2009
Springer
16 years 22 days ago
A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
Fabio Fumarola, Anna Ciampi, Annalisa Appice, Dona...
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
15 years 11 months ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 10 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
CVPR
2006
IEEE
16 years 8 months ago
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingl...
Svetlana Lazebnik, Cordelia Schmid, Jean Ponce