Sciweavers

3368 search results - page 416 / 674
» The Complexity of Query Reliability
Sort
View
CIKM
1999
Springer
15 years 10 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
AAAI
2008
15 years 8 months ago
Extracting Relevant Snippets for Web Navigation
Search engines present fix-length passages from documents ranked by relevance against the query. In this paper, we present and compare novel, language-model based methods for extr...
Qing Li, K. Selçuk Candan, Qi Yan
CASCON
2008
124views Education» more  CASCON 2008»
15 years 8 months ago
Synchronized tag clouds for exploring semi-structured clinical trial data
Searching and comparing information from semi-structured repositories is an important, but cognitively complex activity for internet users. The typical web interface displays a li...
Maria-Elena Hernandez, Sean M. Falconer, Margaret-...
BMCBI
2006
195views more  BMCBI 2006»
15 years 6 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona