Sciweavers

1538 search results - page 92 / 308
» Relative Randomness and Cardinality
Sort
View
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 21 days ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
EUSFLAT
2003
102views Fuzzy Logic» more  EUSFLAT 2003»
14 years 11 months ago
Transitive comparison of marginal probability distributions
A generalized dice model for the pairwise comparison of non-necessarily independent random variables is established. It is shown how the transitivity of the probabilistic relation...
Hans De Meyer, Bernard De Baets, Bart De Schuymer
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
14 years 10 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
IPL
2008
72views more  IPL 2008»
14 years 10 months ago
Turing degrees of reals of positive effective packing dimension
A relatively longstanding question in algorithmic randomness is Jan Reimann's question whether there is a Turing cone of broken dimension. That is, is there a real A such that...
Rod Downey, Noam Greenberg
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 10 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori