Sciweavers

1578 search results - page 156 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
INFOCOM
1996
IEEE
14 years 2 months ago
Flow Labelled IP: A Connectionless Approach to ATM
A number of proposals for supporting IP over ATM are under discussion in the networking community including: LAN emulation, classical IP over ATM, routing over large clouds, and m...
Peter Newman, Thomas L. Lyon, Greg Minshall
TON
1998
112views more  TON 1998»
13 years 9 months ago
IP switching - ATM under IP
IP traffic on the Internet and private enterprise networks has been growing exponentially for some time. This growth is beginning to stress the traditional, processor based design...
Peter Newman, Greg Minshall, Thomas L. Lyon
TON
2002
99views more  TON 2002»
13 years 9 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
ICIP
2005
IEEE
14 years 11 months ago
Sampling schemes for 2-D signals with finite rate of innovation using kernels that reproduce polynomials
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
Pancham Shukla, Pier Luigi Dragotti
ISVC
2007
Springer
14 years 4 months ago
Tensor Lines in Tensor Fields of Arbitrary Order
This paper presents a method to reduce time complexity of the computation of higher–order tensor lines. The method can be applied to higher–order tensors and the spherical harm...
Mario Hlawitschka, Gerik Scheuermann, Alfred Anwan...