Results 1  10
of
3,530
TimingSync Protocol for Sensor Networks
 The First ACM Conference on Embedded Networked Sensor System (SenSys
, 2003
"... Wireless adhoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages that are ..."
Abstract

Cited by 515 (8 self)
 Add to MetaCart
that are timestamped using the local clocks on the nodes. Therefore, time synchronization becomes an indispensable piece of infrastructure in such systems. For years, protocols such as NTP have kept the clocks of networked systems in perfect synchrony. However, this new class of networks has a large density of nodes
Algorithms for Scalable Synchronization on SharedMemory Multiprocessors
 ACM Transactions on Computer Systems
, 1991
"... Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract

Cited by 573 (32 self)
 Add to MetaCart
markedly more pronounced as applications scale. We argue that this problem is not fundamental, and that one can in fact construct busywait synchronization algorithms that induce no memory or interconnect contention. The key to these algorithms is for every processor to spin on separate locally
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 errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit 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
Precomputed Radiance Transfer for RealTime Rendering in Dynamic, LowFrequency Lighting Environments
 ACM Transactions on Graphics
, 2002
"... We present a new, realtime method for rendering diffuse and glossy objects in lowfrequency lighting environments that captures soft shadows, interreflections, and caustics. As a preprocess, a novel global transport simulator creates functions over the object's surface representing transfer of ..."
Abstract

Cited by 470 (28 self)
 Add to MetaCart
of arbitrary, lowfrequency incident lighting into transferred radiance which includes global effects like shadows and interreflections from the object onto itself. At runtime, these transfer functions are applied to actual incident lighting. Dynamic, local lighting is handled by sampling it close
Localization from Mere Connectivity
 In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
, 2003
"... It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. We present an algorithm that uses connectivity information— who is within communications range of whom—to derive the locat ..."
Abstract

Cited by 367 (9 self)
 Add to MetaCart
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. We present an algorithm that uses connectivity information— who is within communications range of whom—to derive
Sampling signals with finite rate of innovation
 IEEE Transactions on Signal Processing
, 2002
"... Abstract—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials ..."
Abstract

Cited by 350 (67 self)
 Add to MetaCart
Abstract—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise
Incremental mapping of large cyclic environments
 In Computational Intelligence in Robotics and Automation
, 1999
"... Mobile robots can use geometric or topological maps of their environment to navigate reliably. Automatic creation of such maps is still an unrealized goal, especially in environments that have large cyclical structures. Drawing on recent techniques of global registration and correlation, we present ..."
Abstract

Cited by 332 (19 self)
 Add to MetaCart
a method, called Local Registration and Global Correlation (LRGC), for reliable reconstruction of consistent global maps from dense range data. The method is attractive because it is incremental, producing an updated map with every new sensor input; and runs in constant time independent of the size
Local Criterion of Quality for Color Difference Formula
"... It is important to be equipped with criterion of correspondence between color difference formula and experimental data of color discrimination of standard observer considering a quality of color printing or measuring. Such criterion is used to distinguish whether applied color difference formula is ..."
Abstract
 Add to MetaCart
) with a great simplification of computation procedure. Criterion of Local NonUniformity Every time we talk about precision of color reproduction and there is a necessity to numerically evaluate a value of error, we have to calculate a color difference. Since it was introduced in 1976, color difference
1 NonUniform Complexity
"... We have seen that there exist “very hard ” languages (i.e., languages that require circuits of size (1 − ε)2n /n). If we can show that there exists a language in N P that is even “moderately hard” (i.e., requires circuits of superpolynomial size) then we will have proved P ̸ = N P. (In some sense, ..."
Abstract
 Add to MetaCart
, for every c, the language we obtain is different. (Indeed, using the time hierarchy theorem, we have that for every c there is a language in P that is not in time(nc).) What is particularly interesting here is that (1) we prove a nonuniform lower bound and (2) the proof is, in some sense, rather simple
LATTICES ON NONUNIFORM TREES
"... Abstract. Let X be alocally finite tree, and let G = Aut(X). Then G is a locally compact group. We show that if X has more than one end, and if G contains a discrete subgroup Γ such that the quotient graph of groups Γ\\X is infinite but has finite covolume, then G contains a nonuniform lattice, tha ..."
Abstract
 Add to MetaCart
Abstract. Let X be alocally finite tree, and let G = Aut(X). Then G is a locally compact group. We show that if X has more than one end, and if G contains a discrete subgroup Γ such that the quotient graph of groups Γ\\X is infinite but has finite covolume, then G contains a nonuniform lattice
Results 1  10
of
3,530