Sciweavers

5046 search results - page 861 / 1010
» Non-redundant data clustering
Sort
View
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 11 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 9 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
EDUTAINMENT
2008
Springer
15 years 9 months ago
Knowledge Discovery by Network Visualization
Hyperlinks among webpages are very important information and are widely used for webpage clustering and webpage ranking. With the explosive growth in the number of webpages availab...
Hong Zhou, Yingcai Wu, Ming-Yuen Chan, Huamin Qu, ...