2996 search results - page 133 / 600 » Numberings and Randomness |
153
click to vote
ASPDAC
2009
ACM
15 years 12 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
166
click to vote
AIED
2009
Springer
16 years 10 hour ago
2009
Springer
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
173
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
264
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
149
Voted
EJC
2006
15 years 5 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...