Sciweavers

522 search results - page 42 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
WETICE
2005
IEEE
14 years 1 months ago
Entropy Based Worm and Anomaly Detection in Fast IP Networks
Detecting massive network events like worm outbreaks in fast IP networks, such as Internet backbones, is hard. One problem is that the amount of traffic data does not allow real-t...
Arno Wagner, Bernhard Plattner
WIOPT
2005
IEEE
14 years 1 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...
EGOV
2005
Springer
14 years 1 months ago
Monitoring and Updating Regulations and Policies for Government Services
One of the challenges citizens and businesses face in interacting with governments for entitled services or compliance services is to find the right set of regulations and rules th...
Soon Ae Chun, Edwin Portscher, James Geller
ADAEUROPE
2004
Springer
14 years 1 months ago
The Chance for Ada to Support Distribution and Real-Time in Embedded Systems
This paper presents a modification of GLADE —the current GNAT implementation of the Ada 95 Distributed Systems Annex (DSA)— to support the development of distributed applicatio...
Juan López Campos, J. Javier Gutiérr...
FSTTCS
2004
Springer
14 years 1 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav