8825 search results - page 322 / 1765 » All for one or one for all |
118
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
125
click to vote
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
118
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Multicast-based data communication is an efficient communication scheme especially in multihop ad hoc networks where the MAC layer is based on one-hop broadcast from one sourc...
ICMCS
2006
IEEE
15 years 8 months ago
2006
IEEE
The fundamental assumption of 3D videos using depth-imagebased rendering is the full availability of range images at video rate. In this work we alleviate this hard demand and ass...