16430 search results - page 2745 / 3286 » On Computable Tree Functions |
166
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
Increasing complexity of the functionalities and the resultant growth in number of gates integrated in a chip coupled with shrinking geometries and short cycle time requirements br...
320
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
437
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
182
click to vote
PODS
2002
ACM
16 years 7 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
221
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...