Sciweavers

13603 search results - page 428 / 2721
» On the Complexity of Computing Treelength
Sort
View
PSD
2004
Springer
132views Database» more  PSD 2004»
16 years 1 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
INFOCOM
2003
IEEE
16 years 1 months ago
Computing the Types of the Relationships between Autonomous Systems
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
Giuseppe Di Battista, Maurizio Patrignani, Maurizi...
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
16 years 13 days ago
Computation of safety control for uncertain piecewise continuous systems on a partial order
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
Michael R. Hafner, Domitilla Del Vecchio
ICIAP
1999
ACM
15 years 12 months ago
Cellular Automata Based Optical Flow Computation for "Just-in-Time" Applications
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
Giovanni Adorni, Stefano Cagnoni, Monica Mordonini
301
Voted
COLT
1992
Springer
15 years 11 months ago
On the Computational Power of Neural Nets
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
Hava T. Siegelmann, Eduardo D. Sontag