Sciweavers

831 search results - page 36 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
PE
2002
Springer
150views Optimization» more  PE 2002»
13 years 9 months ago
Delimiting the range of effectiveness of scalable on-demand streaming
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
Haonan Tan, Derek L. Eager, Mary K. Vernon
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 5 months ago
Distributed Estimation and False Data Detection with Application to Power Networks
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...
Fabio Pasqualetti, Ruggero Carli, Francesco Bullo
COMCOM
2006
154views more  COMCOM 2006»
13 years 10 months ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia
WAIM
2007
Springer
14 years 4 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
IWPEC
2010
Springer
13 years 8 months ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij