Sciweavers

4860 search results - page 672 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
NMR
2004
Springer
15 years 12 months ago
Plan reversals for recovery in execution monitoring
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
Thomas Eiter, Esra Erdem, Wolfgang Faber
INFOCOM
2003
IEEE
15 years 12 months ago
Pseudo Likelihood Estimation in Network Tomography
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
Gang Liang, Bin Yu
186
Voted
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 11 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
15 years 11 months ago
Critical area computation for missing material defects in VLSI circuits
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
Evanthia Papadopoulou
IDA
1997
Springer
15 years 10 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen