28 search results - page 5 / 6 » Discrete Random Walks on One-Sided |
101
click to vote
PRIS
2004
14 years 11 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
ITA
2006
14 years 9 months ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
TIP
2010
14 years 4 months ago
2010
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
SAGA
2009
Springer
15 years 4 months ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...