Sciweavers

4403 search results - page 228 / 881
» Galois Theory of Algorithms
Sort
View
PODC
2006
ACM
16 years 17 days ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
183
Voted
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 11 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
AMC
2007
108views more  AMC 2007»
15 years 6 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
197
Voted
NCA
2008
IEEE
15 years 6 months ago
Polynomial kernel adaptation and extensions to the SVM classifier learning
Three extensions to the Kernel-AdaTron training algorithm for Support Vector Machine classifier learning are presented. These extensions allow the trained classifier to adhere more...
Ramy Saad, Saman K. Halgamuge, Jason Li
ICASSP
2010
IEEE
15 years 3 months ago
A supervisory approach to semi-supervised clustering
We propose a new approach to semi-supervised clustering that utilizes boosting to simultaneously learn both a similarity measure and a clustering of the data from given instancele...
Bryan Conroy, Yongxin Taylor Xi, Peter J. Ramadge