Sciweavers

3874 search results - page 334 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 5 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
CVPR
2012
IEEE
13 years 7 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
ATAL
2009
Springer
15 years 11 months ago
SarsaLandmark: an algorithm for learning in POMDPs with landmarks
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
Michael R. James, Satinder P. Singh
120
Voted
ACISICIS
2009
IEEE
15 years 8 months ago
A Parallel Algorithm for Computer Simulation of Electrocardiogram Based on MPI
—This paper presents a parallel algorithm for computer simulation of Electrocardiogram (ECG) based on a 3-dimensional (3D) whole-heart model. The computer heart model includes ap...
Wenfeng Shen, Weijia Lu, Daming Wei, Weimin Xu, Xi...
APIN
2010
151views more  APIN 2010»
15 years 5 months ago
Improved PLSOM algorithm
The original Parameter-Less Self-Organising Map (PLSOM) algorithm was introduced as a solution to the problems the Self-Organising Map (SOM) encounters when dealing with certain ty...
Erik Berglund