Sciweavers

2766 search results - page 200 / 554
» Algorithms for trigonometric polynomials
Sort
View
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
15 years 8 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla
151
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 6 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
128
Voted
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
15 years 5 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
CORR
2008
Springer
227views Education» more  CORR 2008»
15 years 4 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan