2088 search results - page 300 / 418 » The Probabilistic Method |
110
Voted
ECIR
2010
Springer
15 years 2 months ago
2010
Springer
Web pages are often recognized by others through contexts. These contexts determine how linked pages influence and interact with each other. When differentiating such interactions,...
106
click to vote
ICMLA
2007
15 years 2 months ago
2007
In modern business, educational, and other settings, it is common to provide a digital network that interconnects hardware devices for shared access by the users (e.g., in an ofļ¬...
118
Voted
AAAI
2004
15 years 2 months ago
2004
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
110
Voted
EJC
2006
15 years 25 days 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...
112
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
āFor a linear block code C, its stopping redundancy is deļ¬ned as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...