44 search results - page 8 / 9 » The distinguishing number of Cartesian products of complete ... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
PVLDB
2008
13 years 4 months ago
2008
The Deep Web, i.e., content hidden behind HTML forms, has long been acknowledged as a significant gap in search engine coverage. Since it represents a large portion of the structu...
DM
2008
13 years 4 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
CSCW
2008
ACM
13 years 6 months ago
2008
ACM
Wikipedia's success is often attributed to involving large numbers of contributors who improve the accuracy, completeness and clarity of articles while reducing bias. However...
UAI
2000
13 years 6 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...