Sciweavers

264 search results - page 46 / 53
» On the possibility of faster SAT algorithms
Sort
View
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 1 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
CGF
2010
193views more  CGF 2010»
14 years 10 months ago
Accelerated Visualization of Dynamic Molecular Surfaces
Molecular surfaces play an important role in studying the interactions between molecules. Visualizing the dynamic behavior of molecules is particularly interesting to gain insight...
Norbert Lindow, Daniel Baum, Steffen Prohaska, Han...
BMCBI
2007
106views more  BMCBI 2007»
14 years 10 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
15 years 10 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
BMCBI
2005
162views more  BMCBI 2005»
14 years 10 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes