515 search results - page 98 / 103 » Approximating Markov Processes by Averaging |
178
Voted
TSP
2010
15 years 23 hour ago
2010
This paper is concerned with the performance of a regenerative relaying protocol on fading wireless channels with imperfect channel knowledge at the receivers. Assuming a single s...
169
click to vote
MM
2004
ACM
15 years 10 months ago
2004
ACM
We present a prototype that automatically aligns acoustic musical signals with their corresponding textual lyrics, in a manner similar to manually-aligned karaoke. We tackle this ...
137
Voted
EJC
2007
15 years 5 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
155
click to vote
BC
1998
15 years 5 months ago
1998
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
174
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...