Sciweavers

77 search results - page 9 / 16
» Inferring Vertex Properties from Topology in Large Networks
Sort
View
NECO
2007
127views more  NECO 2007»
15 years 5 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
ICML
2005
IEEE
16 years 6 months ago
Learning class-discriminative dynamic Bayesian networks
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
John Burge, Terran Lane
INFOCOM
2008
IEEE
16 years 14 days ago
HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
BMCBI
2005
127views more  BMCBI 2005»
15 years 6 months ago
Are scale-free networks robust to measurement errors?
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...
Nan Lin, Hongyu Zhao
PAM
2009
Springer
16 years 25 days ago
Multi-layer Monitoring of Overlay Networks
Abstract. Monitoring end-to-end paths in an overlay network is essential for evaluating end-system performance and for troubleshooting anomalous behavior. However, conducting measu...
Mehmet Demirci, Samantha Lo, Srinivasan Seetharama...