Sciweavers

3368 search results - page 72 / 674
» The Complexity of Query Reliability
Sort
View
ESWS
2008
Springer
13 years 10 months ago
A Natural Language Query Interface to Structured Information
Accessing structured data such as that encoded in ontologies and knowledge bases can be done using either syntactically complex formal query languages like SPARQL or complicated fo...
Valentin Tablan, Danica Damljanovic, Kalina Bontch...
BMCBI
2010
142views more  BMCBI 2010»
13 years 9 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
VISUALIZATION
1993
IEEE
14 years 1 months ago
Visual Feedback in Querying Large Databases
In this paper, we describe a database query system that provides visual relevance feedback in querying large databases. The goal of our system is to support the query specificati...
Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
COLT
1993
Springer
14 years 29 days ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
ICSE
2005
IEEE-ACM
14 years 9 months ago
Safe query objects: statically typed objects as remotely executable queries
When building scalable systems that involve general-purpose computation and persistent data, object-oriented languages and relational databases are often essential components. Yet...
William R. Cook, Siddhartha Rai