Sciweavers

2969 search results - page 70 / 594
» A space efficient algorithm for group structure computation
Sort
View
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 3 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
IJON
2008
109views more  IJON 2008»
15 years 3 months ago
Unsupervised learning neural network with convex constraint: Structure and algorithm
This paper proposed a kind of unsupervised learning neural network model, which has special structure and can realize an evaluation and classification of many groups by the compres...
Hengqing Tong, Tianzhen Liu, Qiaoling Tong
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
16 years 4 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ISCAS
2007
IEEE
121views Hardware» more  ISCAS 2007»
15 years 9 months ago
Topological Placement with Multiple Symmetry Groups of Devices for Analog Layout Design
Abstract– This paper presents an improved topological algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible sequen...
Karthik Krishnamoorthy, Sarat C. Maruvada, Florin ...
EJC
2008
15 years 3 months ago
Pooling spaces associated with finite geometry
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
Tayuan Huang, Kaishun Wang, Chih-wen Weng