Sciweavers

7690 search results - page 1349 / 1538
» Clustering Data Streams
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 10 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 10 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 10 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
ACIVS
2009
Springer
15 years 10 months ago
Unsupervised Detection of Gradual Video Shot Changes with Motion-Based False Alarm Removal
The temporal segmentation of a video into shots is a fundamental prerequisite for video retrieval. There are two types of shot boundaries: abrupt shot changes (“cuts”) and grad...
Ralph Ewerth, Bernd Freisleben
APPT
2007
Springer
15 years 8 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
« Prev « First page 1349 / 1538 Last » Next »