Sciweavers

534 search results - page 41 / 107
» Efficient polynomial L-approximations
Sort
View
AAAI
1990
13 years 9 months ago
Physical Impossibility Instead of Fault Models
In this paper we describe the concept of physical impossibility as an alternative to the specification of fault models. These axioms can be used to exclude impossible diagnoses si...
Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl
CSDA
2008
56views more  CSDA 2008»
13 years 8 months ago
Robust designs for series estimation
We discuss optimal design problems for a popular method of series estimation in regression problems. Commonly used design criteria are based on the generalized variance of the est...
Holger Dette, Douglas P. Wiens
TISSEC
2002
123views more  TISSEC 2002»
13 years 7 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield
TON
2008
120views more  TON 2008»
13 years 7 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 5 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang