Sciweavers

6365 search results - page 210 / 1273
» Fast Local Computation Algorithms
Sort
View
DSN
2005
IEEE
15 years 12 months ago
SMRP: Fast Restoration of Multicast Sessions from Persistent Failures
The growing reliance of networked applications on timely and reliable data transfer requires the underlying networking infrastructure to provide adequate services even in the pres...
Jian Wu, Kang G. Shin
CVPR
2000
IEEE
16 years 8 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
COMPGEOM
2005
ACM
15 years 8 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
INFOCOM
2011
IEEE
14 years 10 months ago
Scalable and fully distributed localization with mere connectivity
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu
CVPR
2007
IEEE
16 years 8 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie