Sciweavers

6274 search results - page 147 / 1255
» From query complexity to computational complexity
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
DAGSTUHL
2003
15 years 5 months ago
Query Answering in Inconsistent Databases
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
Leopoldo E. Bertossi, Jan Chomicki
CIDR
2003
106views Algorithms» more  CIDR 2003»
15 years 5 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
VLDB
1992
ACM
151views Database» more  VLDB 1992»
15 years 8 months ago
A Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
Umeshwar Dayal, Gene T. J. Wuu
BMCBI
2010
91views more  BMCBI 2010»
15 years 4 months ago
Ranked retrieval of Computational Biology models
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
Ron Henkel, Lukas Endler, Andre Peters, Nicolas Le...