779 search results - page 114 / 156 » Algorithms for the Sample Mean of Graphs |
129
click to vote
TGIS
2010
14 years 11 months ago
2010
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
140
click to vote
COLT
1999
Springer
15 years 8 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
179
click to vote
CAGD
2005
15 years 4 months ago
2005
We propose a new wavelet compression algorithm based on the rate-distortion optimization for densely sampled triangular meshes. Exploiting the normal remesher of Guskov et al., th...
191
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
133
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper proposes a new blind algorithm, based on Mixture Kalman Filtering (MKF), for joint carrier recovery and channel estimation in time-selective Rayleigh fading channels. M...