1511 search results - page 97 / 303 » Randomness, lowness and degrees |
160
click to vote
CGF
2007
15 years 6 months ago
2007
Performance has a spontaneity and “aliveness” that can be difficult to capture in more methodical animation processes such as keyframing. Access to performance animation has ...
167
click to vote
SIGMETRICS
2003
ACM
15 years 11 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
163
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
134
click to vote
ICEIS
2009
IEEE
16 years 29 days ago
2009
IEEE
Abstract. The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiti...
184
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...