Sciweavers

1538 search results - page 124 / 308
» Relative Randomness and Cardinality
Sort
View
JILP
2000
103views more  JILP 2000»
14 years 9 months ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young
CMOT
1999
105views more  CMOT 1999»
14 years 9 months ago
Friendship Networks Through Time: An Actor-Oriented Dynamic Statistical Network Model
We propose a class of actor-oriented statistical models for closed social networks in general, and friendship networks in particular. The models are random utility models develope...
Gerhard G. Van De Bunt, Marijtje A. J. Van Duijn, ...
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 6 months ago
Comparing Prediction Market Structures, With an Application to Market Making
Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed ...
Aseem Brahma, Sanmay Das, Malik Magdon-Ismail
JCT
2010
127views more  JCT 2010»
14 years 4 months ago
On the density of a graph and its blowup
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Asaf Shapira, Raphael Yuster
JMLR
2010
151views more  JMLR 2010»
14 years 4 months ago
Understanding the difficulty of training deep feedforward neural networks
Whereas before 2006 it appears that deep multilayer neural networks were not successfully trained, since then several algorithms have been shown to successfully train them, with e...
Xavier Glorot, Yoshua Bengio