Sciweavers

1300 search results - page 187 / 260
» Association Schemoids and Their Categories
Sort
View
POPL
2004
ACM
15 years 11 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
85
Voted
RECOMB
2004
Springer
15 years 11 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
15 years 11 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
181
Voted
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 11 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
PODS
2006
ACM
122views Database» more  PODS 2006»
15 years 11 months ago
Inverting schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin