Sciweavers

1382 search results - page 122 / 277
» Procedural Generation of Roads
Sort
View
AUTOMATICA
2008
83views more  AUTOMATICA 2008»
14 years 10 months ago
Periodic smoothing splines
Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...
Hiroyuki Kano, Magnus Egerstedt, Hiroyuki Fujioka,...
DM
2006
91views more  DM 2006»
14 years 10 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
IGPL
2008
93views more  IGPL 2008»
14 years 10 months ago
Cut-Based Abduction
In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such ...
Marcello D'Agostino, Marcelo Finger, Dov M. Gabbay
JC
2008
96views more  JC 2008»
14 years 10 months ago
Adaptivity and computational complexity in the numerical solution of ODEs
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
Silvana Ilie, Gustaf Söderlind, Robert M. Cor...
RSA
2006
88views more  RSA 2006»
14 years 10 months ago
Randomly coloring sparse random graphs with fewer colors than the maximum degree
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...