303 search results - page 32 / 61 » Discrete Mathematics for Computer Science, Some Notes |
JSCIC
2008
14 years 9 months ago
2008
In this paper we shall discuss the numerical simulation of higher order geometric flows by level set methods. Main examples under considerations are surface diffusion and the Will...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
103
click to vote
SOFSEM
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
101
click to vote
TCS
2010
14 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...