2434 search results - page 368 / 487 » Algorithmic Randomness of Closed Sets |
148
click to vote
ICDT
2001
ACM
15 years 8 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
139
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
131
Voted
GMP
2006
IEEE
15 years 9 months ago
2006
IEEE
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
126
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
230
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...