26 search results - page 5 / 6 » Vertex and Hyperedge Connectivity in Dynamic Graph Streams |
113
click to vote
CVPR
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
114
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
ATMOS
2008
14 years 11 months ago
2008
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...