Sciweavers

1628 search results - page 316 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 7 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 1 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy
DIS
2007
Springer
14 years 1 months ago
A Hilbert Space Embedding for Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
Alexander J. Smola, Arthur Gretton, Le Song, Bernh...
CIKM
1998
Springer
13 years 11 months ago
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang
EDBT
1998
ACM
155views Database» more  EDBT 1998»
13 years 11 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...