Sciweavers

1578 search results - page 158 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ANOR
2004
170views more  ANOR 2004»
13 years 10 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
JNSM
2002
218views more  JNSM 2002»
13 years 9 months ago
An Agent-based Connection Management Protocol for Ad Hoc Wireless Networks
Realizing high volume of data transmission in real time communication in a highly dynamic architecture like Mobile Ad hoc Networks (MANET) still remains a major point of research....
Romit Roy Choudhury, Krishna Paul, Somprakash Band...
ICIP
2010
IEEE
13 years 8 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
DICTA
2003
13 years 11 months ago
Shift-invariance in the Discrete Wavelet Transform
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...
Andrew P. Bradley
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 10 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy