Sciweavers

10608 search results - page 1711 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
16 years 1 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
ICDCS
2009
IEEE
16 years 1 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ALT
2001
Springer
16 years 1 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
ICCD
2006
IEEE
113views Hardware» more  ICCD 2006»
16 years 1 months ago
High-speed Factorization Architecture for Soft-decision Reed-Solomon Decoding
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
Xinmiao Zhang
ICCD
2003
IEEE
127views Hardware» more  ICCD 2003»
16 years 1 months ago
Structural Detection of Symmetries in Boolean Functions
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
Guoqiang Wang, Andreas Kuehlmann, Alberto L. Sangi...
« Prev « First page 1711 / 2122 Last » Next »