Sciweavers

1722 search results - page 143 / 345
» On the sample mean of graphs
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
16 years 28 days ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
MM
2010
ACM
151views Multimedia» more  MM 2010»
15 years 6 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
ICPR
2006
IEEE
16 years 7 months ago
Graph-based transformation manifolds for invariant pattern recognition with kernel methods
We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a ke...
Alexei Pozdnoukhov, Samy Bengio
VLSID
1996
IEEE
130views VLSI» more  VLSID 1996»
15 years 10 months ago
A systolic architecture for LMS adaptive filtering with minimal adaptation delay
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...
S. Ramanathan, V. Visvanathan
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
15 years 7 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...