Sciweavers

5215 search results - page 54 / 1043
» Quantum clustering algorithms
Sort
View
ISMVL
2008
IEEE
160views Hardware» more  ISMVL 2008»
15 years 4 months ago
Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
Daniel Große, Robert Wille, Gerhard W. Dueck...
CORIA
2008
14 years 11 months ago
Involving Validity Indices in Document Clustering
The goal of any clustering algorithm is to find the optimal clustering solution with the optimal number of clusters. In order to evaluate a clustering solution, a number of validit...
Ahmad El Sayed, Hakim Hacid, Djamel A. Zighed
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
14 years 11 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
PRL
2010
188views more  PRL 2010»
14 years 4 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
15 years 10 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy