Sciweavers

3267 search results - page 575 / 654
» Generalized quasirandom graphs
Sort
View
ENTCS
2008
95views more  ENTCS 2008»
14 years 11 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
CAGD
2006
72views more  CAGD 2006»
14 years 11 months ago
Discrete one-forms on meshes and applications to 3D mesh parameterization
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
Steven J. Gortler, Craig Gotsman, Dylan Thurston
IANDC
2006
113views more  IANDC 2006»
14 years 11 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
COR
2007
108views more  COR 2007»
14 years 11 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
CORR
2007
Springer
146views Education» more  CORR 2007»
14 years 11 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang