Sciweavers

4850 search results - page 443 / 970
» Approximate Data Structures with Applications
Sort
View
FORTE
2011
14 years 11 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 8 months ago
Relational data pre-processing techniques for improved securities fraud detection
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
Andrew Fast, Lisa Friedland, Marc Maier, Brian Tay...
DBPL
1997
Springer
90views Database» more  DBPL 1997»
15 years 11 months ago
Implementing Incremental View Maintenance in Nested Data Models
Previous research on materialized views has primarily been in the context of flat relational databases--materialized views defined in terms of one or more flat relations. This pape...
Akira Kawaguchi, Daniel F. Lieuwen, Inderpal Singh...
HT
2000
ACM
15 years 12 months ago
Generating instructional hypermedia with APHID
We propose a method (APHID) that assists an instructional designer to define format, structure and sequence within an instructional hypermedia application. Our method uses concept...
Judi R. Thomson, Jim E. Greer, John Cooke
APBC
2007
15 years 9 months ago
A Probabilistic Method to Identify Compensatory Substitutions for Pathogenic Mutations
real or abstract. It provides a widely applicable approach to the prediction of compensatory substitutions for CPDs, avoiding any reliance on rigid non-probabilistic criteria or st...
B. C. Easton, A. V. Isaev, Gavin A. Huttley, Peter...