Sciweavers

5215 search results - page 145 / 1043
» Quantum clustering algorithms
Sort
View
164
Voted
FOCS
2002
IEEE
15 years 10 months ago
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
Vikraman Arvind, Piyush P. Kurur
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
14 years 12 months ago
Consensus in non-commutative spaces
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
Rodolphe Sepulchre, Alain Sarlette, Pierre Rouchon
OODBS
2000
110views Database» more  OODBS 2000»
15 years 8 months ago
Opportunistic Prioritised Clustering Framework (OPCF)
Ever since the `early days' of database management systems, clustering has proven to be one of the most effective performance enhancement techniques for object oriented datab...
Zhen He, Alonso Marquez, Stephen Blackburn
218
Voted
VLDB
1999
ACM
224views Database» more  VLDB 1999»
15 years 9 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
ICCV
2007
IEEE
16 years 6 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...