Sciweavers

13306 search results - page 445 / 2662
» Theoretical Computer Science
Sort
View
CAD
2011
Springer
15 years 2 months ago
Smooth Bi-3 spline surfaces with fewest knots
Converting a quadrilateral input mesh into a C1 surface with one bi-3 tensorproduct spline patch per facet is a classical challenge. We give explicit local averaging formulas for ...
Jianhua Fan, Jörg Peters
DAM
2011
15 years 2 months ago
On the b-coloring of P4-tidy graphs
A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic ...
Clara Inés Betancur Velasquez, Flavia Bonom...
DAM
2011
15 years 2 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
TCS
2011
15 years 2 months ago
Four states are enough!
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
Nicolas Ollinger, Gaétan Richard
191
Voted
TCS
2010
15 years 2 months ago
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule
We propose a modification of the widely known Benjamin-Johnson-Hui (BJH) cellular automaton model for single-lane traffic simulation. In particular, our model includes a `slow-to-...
Adam Clarridge, Kai Salomaa