Sciweavers

528 search results - page 90 / 106
» Modularizing error recovery
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
EUROSYS
2008
ACM
14 years 4 months ago
Samurai: protecting critical data in unsafe languages
Programs written in type-unsafe languages such as C and C++ incur costly memory errors that result in corrupted data structures, program crashes, and incorrect results. We present...
Karthik Pattabiraman, Vinod Grover, Benjamin G. Zo...
AAAI
1998
13 years 9 months ago
Conversation Machines for Transaction Processing
We have built a set of integrated AI systems (called conversation machines) to enable transaction processing over the telephone for limited domains like stock trading and banking....
Wlodek Zadrozny, Catherine G. Wolf, Nanda Kambhatl...
PERCOM
2010
ACM
13 years 6 months ago
Resilient image sensor networks in lossy channels using compressed sensing
—Data loss in wireless communications greatly affects the reconstruction quality of a signal. In the case of images, data loss results in a reduction in quality of the received i...
Scott Pudlewski, Arvind Prasanna, Tommaso Melodia
SIGSOFT
2005
ACM
14 years 8 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar