Sciweavers

32545 search results - page 6129 / 6509
» Data Structures and Algorithms
Sort
View
ISAAC
2005
Springer
98views Algorithms» more  ISAAC 2005»
16 years 9 days ago
Complexity of the Min-Max (Regret) Versions of Cut Problems
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ISMIS
2005
Springer
16 years 9 days ago
Learning the Daily Model of Network Traffic
Abstract. Anomaly detection is based on profiles that represent normal behaviour of users, hosts or networks and detects attacks as significant deviations from these profiles. In t...
Costantina Caruso, Donato Malerba, Davide Papagni
186
Voted
IWQOS
2005
Springer
16 years 9 days ago
A High-Throughput Overlay Multicast Infrastructure with Network Coding
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
Mea Wang, Zongpeng Li, Baochun Li
SCALESPACE
2005
Springer
16 years 8 days ago
Image Deblurring in the Presence of Salt-and-Pepper Noise
The problem of image deblurring in the presence of salt and pepper noise is considered. Standard image deconvolution algorithms, that are designed for Gaussian noise, do not perfor...
Leah Bar, Nir A. Sochen, Nahum Kiryati
SCIA
2005
Springer
108views Image Analysis» more  SCIA 2005»
16 years 8 days ago
Light Field Reconstruction Using a Planar Patch Model
Light fields are known for their potential in generating 3D reconstructions of a scene from novel viewpoints without need for a model of the scene. Reconstruction of novel views, ...
Adam Bowen, Andrew Mullins, Roland G. Wilson, Nasi...
« Prev « First page 6129 / 6509 Last » Next »