Sciweavers

263 search results - page 29 / 53
» Path partitions of hypercubes
Sort
View
JSAC
2007
107views more  JSAC 2007»
13 years 7 months ago
Admission control in data transfers over lightpaths
—The availability of optical network infrastructure and appropriate user control software has recently made it possible for scientists to establish end-to-end circuits across mul...
Wojciech M. Golab, Raouf Boutaba
HPCC
2007
Springer
14 years 1 months ago
Speculative Parallelization - Eliminating the Overhead of Failure
Existing runtime parallelization techniques impose severe performance penalties when a speculative parallelization is attempted and fails. Some techniques require a sequential rest...
Mikel Luján, Phyllis Gustafson, Michael Pal...
BROADNETS
2004
IEEE
13 years 11 months ago
Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
Michael J. Neely, Eytan Modiano
STACS
2000
Springer
13 years 11 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...
CORR
1999
Springer
145views Education» more  CORR 1999»
13 years 7 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein