Results 1 - 10
of
3,105
Tapestry: A Resilient Global-scale Overlay for Service Deployment
- IEEE Journal on Selected Areas in Communications
, 2004
"... We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, locationindependent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API ..."
Abstract
-
Cited by 598 (14 self)
- Add to MetaCart
We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, locationindependent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API
Web Caching and Zipf-like Distributions: Evidence and Implications
- IN INFOCOM
, 1999
"... This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2] ..."
Abstract
-
Cited by 1091 (2 self)
- Add to MetaCart
]. The ;econd issue relates to a number of recent studies on the characteristics of web proxy traces, which have shown that the hit-ratios and temporal locality of the traces exhibit certain asymptotic properties that are uniform across the different sets of the traces [43, [XO], [71, [XO], [XS]. In partlc
Loopy belief propagation for approximate inference: An empirical study. In:
- Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract
-
Cited by 676 (15 self)
- Add to MetaCart
tiply connected networks: When loops are present, the network is no longer singly connected and local propaga tion schemes will invariably run into trouble . We believe there are general undiscovered theorems about the performance of belief propagation on loopy DAGs. These theo rems, which may have
Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets
, 1997
"... this paper, we impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) ..."
Abstract
-
Cited by 297 (3 self)
- Add to MetaCart
, to keep the virtual backbone as small as possible, we use an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs
Design and Analysis of an MST-Based Topology Control Algorithm
, 2002
"... In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this algorithm, each node builds its local minimum spanning tree independently and only keeps on-tree nodes that are one-hop away a ..."
Abstract
-
Cited by 278 (7 self)
- Add to MetaCart
In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this algorithm, each node builds its local minimum spanning tree independently and only keeps on-tree nodes that are one-hop away
One sense per collocation
- In Proceedings of the ARPA Human Language Technology Workshop
, 1993
"... Previous work [Gale, Church and Yarowsky, 1992] showed that with high probability a polysemous word has one sense per discourse. In this paper we show that for certain definitions of collocation, a polysemous word exhibits essentially only one sense per collocation. We test this empirical hypothesis ..."
Abstract
-
Cited by 186 (6 self)
- Add to MetaCart
hypothesis for several definitions of sense and collocation, and discover that it holds with 90-99 % accuracy for binary ambiguities. We utilize this property in a disambiguation algorithm that achieves precision of 92 % using combined models of very local context. 1.
Analysis of a local search heuristic for facility location problems
- IN PROCEEDINGS OF THE 9TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1998
"... In this paper, we study approximation algorithms for several NP-hard facility location problems. We prove that a simple local search heuristic yields polynomial-time constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility loca ..."
Abstract
-
Cited by 158 (3 self)
- Add to MetaCart
location problem. (For the k-median problem, our algorithms require a constant-factor blowup in the parameter k.) This local search heuristic was rst proposed several decades ago, and has been shown to exhibit good practical performance in empirical studies. We also extend the above results to obtain
A quantitative description of short-term plasticity at excitatory synapses in layer 2/3 of rat primary visual cortex
- J Neurosci
, 1997
"... Cortical synapses exhibit several forms of short-term plasticity, but the contribution of this plasticity to visual response dynamics is unknown. In part, this is because the simple patterns of stimulation used to probe plasticity in vitro do not correspond to patterns of activity that occur in vivo ..."
Abstract
-
Cited by 185 (5 self)
- Add to MetaCart
Cortical synapses exhibit several forms of short-term plasticity, but the contribution of this plasticity to visual response dynamics is unknown. In part, this is because the simple patterns of stimulation used to probe plasticity in vitro do not correspond to patterns of activity that occur
Coil sensitivity encoding for fast MRI. In:
- Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract
-
Cited by 193 (3 self)
- Add to MetaCart
or collimation but by spectral analysis. The idea of Lauterbur (1) to encode object contrast in the resonance spectrum by a magnetic field gradient forms the exclusive basis of signal localization in Fourier imaging. However powerful, the gradient-encoding concept implies a fundamental restriction. Only one
High-quality Motion Deblurring from a Single Image
, 2008
"... Figure 1 High quality single image motion-deblurring. The left sub-figure shows one captured image using a hand-held camera under dim light. It is severely blurred by an unknown kernel. The right sub-figure shows our deblurred image result computed by estimating both the blur kernel and the unblurre ..."
Abstract
-
Cited by 184 (6 self)
- Add to MetaCart
new local smoothness prior that reduces ringing artifacts by constraining contrast in the unblurred image wherever the blurred image exhibits low contrast. Finally, we describe an efficient optimization scheme that alternates between blur kernel estimation and unblurred image restoration until
Results 1 - 10
of
3,105