Sciweavers

3247 search results - page 352 / 650
» Randomized smoothing networks
Sort
View
AVI
2006
15 years 8 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
AI
2008
Springer
15 years 6 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
QUESTA
2007
117views more  QUESTA 2007»
15 years 6 months ago
Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...
Sandeep Juneja
TIST
2011
136views more  TIST 2011»
15 years 1 months ago
Probabilistic models for concurrent chatting activity recognition
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
Jane Yung-jen Hsu, Chia-chun Lian, Wan-rong Jih
ICNP
1997
IEEE
15 years 11 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda