Sciweavers

2040 search results - page 21 / 408
» On the Complexity of Error Explanation
Sort
View
JC
2006
53views more  JC 2006»
13 years 7 months ago
The randomized information complexity of elliptic PDE
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
Stefan Heinrich
SIGSOFT
2008
ACM
14 years 8 months ago
Effective blame for information-flow violations
Programs trusted with secure information should not release that information in ways contrary to system policy. However, when a program contains an illegal flow of information, cu...
Dave King 0002, Trent Jaeger, Somesh Jha, Sanjit A...
ICML
2008
IEEE
14 years 8 months ago
On-line discovery of temporal-difference networks
We present an algorithm for on-line, incremental discovery of temporal-difference (TD) networks. The key contribution is the establishment of three criteria to expand a node in TD...
Takaki Makino, Toshihisa Takagi
DEBS
2010
ACM
13 years 11 months ago
Reliable complex event detection for pervasive computing
Complex event processing for pervasive computing must deal with various sources of error. In this paper, we focus on improving complex event detector handling of several types of ...
Dan O'Keeffe, Jean Bacon
INFOCOM
2003
IEEE
14 years 1 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan