Sciweavers

1709 search results - page 96 / 342
» networks 2000
Sort
View
WMCSA
2000
IEEE
14 years 2 months ago
Optimising thin clients for wireless active-media applications
The thin client model is uniquely suited for lowbandwidth mobile environments, where resource-poor devices may need to access critical applications over wireless networks. In this...
Cumbur Aksoy, Abdelsalam Helal
ACSAC
2000
IEEE
14 years 2 months ago
A Network Audit System for Host-based Intrusion Detection (NASHID) in Linux
Recent work has shown that conventional operating system audit trails are insufficient to detect low-level network attacks. Because audit trails are typically based upon system c...
Thomas E. Daniels, Eugene H. Spafford
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 11 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
NN
2000
Springer
161views Neural Networks» more  NN 2000»
13 years 10 months ago
How good are support vector machines?
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
Sarunas Raudys
CN
2000
96views more  CN 2000»
13 years 10 months ago
Dynamic routing and resource allocation in WDM transport networks
This contribution concentrates on dynamic routing in WDM (Wavelength Division Multiplexing) networks. It is shown that a strategy based on precalculated alternatives and an adapti...
Jan Späth