750 search results - page 46 / 150 » Reconstruction for Models on Random Graphs |
108
click to vote
ICIAP
2009
ACM
16 years 12 days ago
2009
ACM
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...
119
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
156
click to vote
ICML
2003
IEEE
16 years 19 days ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...