Sciweavers

1722 search results - page 78 / 345
» On the sample mean of graphs
Sort
View
123
Voted
COLT
2010
Springer
14 years 10 months ago
Best Arm Identification in Multi-Armed Bandits
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
Jean-Yves Audibert, Sébastien Bubeck, R&eac...
GD
1997
Springer
15 years 4 months ago
Implementing a General-Purpose Edge Router
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
David P. Dobkin, Emden R. Gansner, Eleftherios Kou...
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 19 days ago
A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
Suhan Choi, S. Sandeep Pradhan
84
Voted
ICPR
2008
IEEE
15 years 7 months ago
Pattern vectors from the Ihara zeta function
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
Peng Ren, Richard C. Wilson, Edwin R. Hancock
DEXAW
1999
IEEE
119views Database» more  DEXAW 1999»
15 years 4 months ago
Structure-Based Similarity Search with Graph Histograms
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
Apostolos Papadopoulos, Yannis Manolopoulos