104 search results - page 18 / 21 » An Improved Random Neighborhood Graph Approach |
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
140
click to vote
PODC
2011
ACM
14 years 13 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
118
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...