Sciweavers

3247 search results - page 264 / 650
» Randomized smoothing networks
Sort
View
WSCG
2001
83views more  WSCG 2001»
15 years 7 months ago
A Digital Teletext Service
Digital Teletext is one of the most important interactive services of emerging digital television. As an enhanced version of existing analogue Teletext service, it's a reside...
Chengyuan Peng, Petri Vuorimaa
CGF
2008
110views more  CGF 2008»
15 years 6 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
TIT
1998
126views more  TIT 1998»
15 years 5 months ago
An Asymptotic Property of Model Selection Criteria
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
Yuhong Yang, Andrew R. Barron
MOBIHOC
2007
ACM
16 years 5 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
SPAA
2004
ACM
15 years 11 months ago
Pagoda: a dynamic overlay network for routing, data management, and multicasting
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
Ankur Bhargava, Kishore Kothapalli, Chris Riley, C...