41 search results - page 8 / 9 » Vertex Sparsifiers: New Results from Old Techniques |
ATAL
2007
Springer
14 years 12 days ago
2007
Springer
To cope with large scale, agents are usually organized in a network such that an agent interacts only with its immediate neighbors in the network. Reinforcement learning technique...
SIGSOFT
2006
ACM
14 years 5 days ago
2006
ACM
The change history of a software project contains a rich collection of code changes that record previous development experience. Changes that fix bugs are especially interesting, ...
VISUALIZATION
1999
IEEE
13 years 10 months ago
1999
IEEE
Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering s...
CGF
2007
13 years 6 months ago
2007
Laplacian coordinates as a local shape descriptor have been employed in mesh editing. As they are encoded in the global coordinate system, they need to be transformed locally to r...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...