39 search results - page 7 / 8 » The Cover Time of Deterministic Random Walks |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
STACS
2004
Springer
13 years 11 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
Book
This is a great draft book about stochastic calculus and finance. It covers large number of topics such as Introduction to Probability Theory, Conditional Expectation, Arbitrage Pr...
VLDB
1998
ACM
13 years 10 months ago
1998
ACM
Deterministic testing of SQL database systems is human intensive and cannot adequately cover the SQL input domain. A system (RAGS), was built to stochastically generate valid SQL ...