Sciweavers

9842 search results - page 1738 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
16 years 4 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 4 months ago
Co-evolution of social and affiliation networks
In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generati...
Elena Zheleva, Hossam Sharara, Lise Getoor
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 4 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
PODS
2009
ACM
229views Database» more  PODS 2009»
16 years 4 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
« Prev « First page 1738 / 1969 Last » Next »