Sciweavers

2859 search results - page 476 / 572
» Querying Complex Structured Databases
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
SSDBM
2005
IEEE
99views Database» more  SSDBM 2005»
14 years 1 months ago
Incorporating Semantics in Scientific Workflow Authoring
The tools used to analyze scientific data are often distinct from those used to archive, retrieve, and query data. A scientific workflow environment, however, allows one to seamles...
Chad Berkley, Shawn Bowers, Matthew B. Jones, Bert...
ICFP
2010
ACM
13 years 9 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
IIIX
2006
ACM
14 years 2 months ago
Slicing and dicing the information space using local contexts
In recent years there has been growing interest in faceted grouping of documents for Interactive Information Retrieval (IIR). It is suggested that faceted grouping can offer a fl...
Hideo Joho, Joemon M. Jose
JELIA
1998
Springer
14 years 10 days ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche