Sciweavers

3368 search results - page 534 / 674
» The Complexity of Query Reliability
Sort
View
ICCSA
2007
Springer
14 years 14 hour ago
Improving the Customization of Natural Language Interface to Databases Using an Ontology
Natural language interfaces to databases are considered one of the best alternatives for final users who wish to make complex, uncommon and frequent queries, which is a very common...
M. Jose A. Zarate, Rodolfo A. Pazos, Alexander F. ...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 11 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
ICFP
2010
ACM
13 years 11 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
BMCBI
2008
81views more  BMCBI 2008»
13 years 10 months ago
A perspective for biomedical data integration: Design of databases for flow cytometry
Background: The integration of biomedical information is essential for tackling medical problems. We describe a data model in the domain of flow cytometry (FC) allowing for massiv...
John Drakos, Marina Karakantza, Nicholas C. Zoumbo...
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 10 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...