Sciweavers

5329 search results - page 269 / 1066
» The Weighted Majority Algorithm
Sort
View
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 10 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
COMPGEOM
2005
ACM
15 years 8 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
NIPS
2008
15 years 8 months ago
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
John W. Roberts, Russ Tedrake
ISCI
2007
138views more  ISCI 2007»
15 years 6 months ago
A fast algorithm for one-unit ICA-R
Independent component analysis (ICA) aims to recover a set of unknown mutually independent source signals from their observed mixtures without knowledge of the mixing coefficients...
Qiu-Hua Lin, Yong-Rui Zheng, Fuliang Yin, Hualou L...
CORR
2011
Springer
136views Education» more  CORR 2011»
15 years 1 months ago
Degree Fluctuations and the Convergence Time of Consensus Algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Alexander Olshevsky, John N. Tsitsiklis