2503 search results - page 241 / 501 » A study of 3-arc graphs |
148
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
162
click to vote
CCCG
2008
15 years 8 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
178
click to vote
NETWORKING
2007
15 years 8 months ago
2007
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
206
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
158
click to vote
CGF
2008
15 years 6 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...