Sciweavers

1247 search results - page 196 / 250
» A Generalization of Jumps and Labels
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 10 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
CVIU
2008
180views more  CVIU 2008»
14 years 10 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
ENTCS
2010
133views more  ENTCS 2010»
14 years 10 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
COMBINATORICS
2006
101views more  COMBINATORICS 2006»
14 years 9 months ago
Optimal Penney Ante Strategy via Correlation Polynomial Identities
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
Daniel Felix
FUIN
2006
85views more  FUIN 2006»
14 years 9 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang