1314 search results - page 221 / 263 » Approximate data mining in very large relational data |
126
click to vote
ALGORITHMICA
2000
15 years 1 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
113
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Purpose – This paper2 discusses the new scientific search service Google Scholar (GS). This search engine, intended for searching exclusively scholarly documents, will be descri...
183
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
126
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: The variety of DNA microarray formats and datasets presently available offers an unprecedented opportunity to perform insightful comparisons of heterogeneous data. Cro...
118
click to vote
IWPSE
2007
IEEE
15 years 7 months ago
2007
IEEE
Predicting the defects in the next release of a large software system is a very valuable asset for the project manger to plan her resources. In this paper we argue that temporal f...