Sciweavers

1802 search results - page 216 / 361
» Complexity Theory for Operators in Analysis
Sort
View
SC
2005
ACM
15 years 12 months ago
PerfExplorer: A Performance Data Mining Framework For Large-Scale Parallel Computing
Parallel applications running on high-end computer systems manifest a complexity of performance phenomena. Tools to observe parallel performance attempt to capture these phenomena...
Kevin A. Huck, Allen D. Malony
FAST
2008
15 years 8 months ago
EIO: Error Handling is Occasionally Correct
The reliability of file systems depends in part on how well they propagate errors. We develop a static analysis technique, EDP, that analyzes how file systems and storage device d...
Haryadi S. Gunawi, Cindy Rubio-González, An...
CORR
2011
Springer
206views Education» more  CORR 2011»
15 years 1 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
CSL
2004
Springer
15 years 11 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
16 years 6 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...