Sciweavers

1729 search results - page 332 / 346
» On Bounds for the k-Partitioning of Graphs
Sort
View
EJC
2007
14 years 9 months ago
Deterministic random walks on the integers
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...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
15 years 10 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan
ECCV
2008
Springer
15 years 11 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
GIS
2004
ACM
15 years 10 months ago
A new approach for a topographic feature-based characterization of digital elevation data
Triangular Irregular Network (TIN) and Regular Square Grid (RSG) are widely used for representing 2.5 dimensional spatial data. However, these models are not defined from the topo...
Eric Saux, Ki-Joune Li, Min-Hwan Kim, Rémy ...
SIGSOFT
2003
ACM
15 years 10 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...