2107 search results - page 127 / 422 » b 2007 |
144
Voted
ALGORITHMICA
2007
15 years 6 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
149
Voted
ACL
2003
15 years 7 months ago
2003
Pipelined Natural Language Generation (NLG) systems have grown increasingly complex as architectural modules were added to support language functionalities such as referring expre...
158
click to vote
NIPS
2003
15 years 7 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
137
click to vote
NIPS
1998
15 years 7 months ago
1998
The execution order of a block of computer instructions can make a difference in its running time by a factor of two or more. In order to achieve the best possible speed, compiler...
172
click to vote
NIPS
1993
15 years 7 months ago
1993
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...