Sciweavers

3639 search results - page 61 / 728
» Provenance as Dependency Analysis
Sort
View
DASFAA
2010
IEEE
141views Database» more  DASFAA 2010»
15 years 4 months ago
Optimizing Write Performance for Read Optimized Databases
Compression in column-oriented databases has been proven to offer both performance enhancements and reductions in storage consumption. This is especially true for read access as c...
Jens Krüger, Martin Grund, Christian Tinnefel...
BIOINFORMATICS
2011
14 years 1 months ago
A method for probing the mutational landscape of amyloid structure
Motivation: Proteins of all kinds can self-assemble into highly ordered β-sheet aggregates known as amyloid fibrils, important both biologically and clinically. However, the spe...
Charles W. O'Donnell, Jérôme Waldisp&...
ISI
2004
Springer
15 years 3 months ago
Semantic Analysis for Monitoring Insider Threats
Malicious insiders’ difficult-to-detect activities pose serious threats to the intelligence community (IC) when these activities go undetected. A novel approach that integrates ...
Svetlana Symonenko, Elizabeth D. Liddy, Ozgur Yilm...
AIPS
2009
14 years 11 months ago
Exploiting N-Gram Analysis to Predict Operator Sequences
N-gram analysis provides a means of probabilistically predicting the next item in a sequence. Due originally to Shannon, it has proven an effective technique for word prediction i...
Christian J. Muise, Sheila A. McIlraith, Jorge A. ...
LPAR
2004
Springer
15 years 3 months ago
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
Jürgen Giesl, René Thiemann, Peter Sch...