Results 1 - 10 of 168,200

Nonlinear total variation based noise removal algorithms

by Leonid I. Rudin, Stanley Osher, Emad Fatemi , 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract - Cited by 2271 (51 self) - Add to MetaCart
A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using

Time, Clocks, and the Ordering of Events in a Distributed System

by Leslie Lamport , 1978
"... The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering i ..."
Abstract - Cited by 2869 (14 self) - Add to MetaCart
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering

Real-Time Dynamic Voltage Scaling for Low-Power Embedded Operating Systems

by Padmanabhan Pillai, Kang G. Shin , 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract - Cited by 501 (4 self) - Add to MetaCart
importance, is largely overlooked/under-developed. To provide real-time guarantees, DVS must consider deadlines and periodicity of real-time tasks, requiring integration with the real-time scheduler. In this paper, we present a class of novel algorithms called real-time DVS (RT-DVS) that modify the OS

Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations

by Jure Leskovec, Jon Kleinberg, Christos Faloutsos , 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract - Cited by 541 (48 self) - Add to MetaCart
heavy tails for in- and out-degree distributions, communities, small-world phenomena, and others. However, given the lack of information about network evolution over long periods, it has been hard to convert these findings into statements about trends over time. Here we study a wide range of real graphs

Numerical Solutions of the Euler Equations by Finite Volume Methods Using Runge-Kutta Time-Stepping Schemes

by Antony Jameson, Wolfgang Schmidt, Eli Turkel , 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract - Cited by 517 (78 self) - Add to MetaCart
to determine the steady transonic flow past an airfoil using an O mesh. Convergence to a steady state is accelerated by the use of a variable time step determined by the local Courant member, and the introduction of a forcing term proportional to the difference between the local total enthalpy and its free

Representing twentieth century space-time climate variability, part 1: development of a 1961-90 mean monthly terrestrial climatology

by Mark New, Mike Hulme, Phil Jones - Journal of Climate , 1999
"... The construction of a 0.58 lat 3 0.58 long surface climatology of global land areas, excluding Antarctica, is described. The climatology represents the period 1961–90 and comprises a suite of nine variables: precipitation, wet-day frequency, mean temperature, diurnal temperature range, vapor pressur ..."
Abstract - Cited by 581 (13 self) - Add to MetaCart
The construction of a 0.58 lat 3 0.58 long surface climatology of global land areas, excluding Antarctica, is described. The climatology represents the period 1961–90 and comprises a suite of nine variables: precipitation, wet-day frequency, mean temperature, diurnal temperature range, vapor

Panel Cointegration; Asymptotic and Finite Sample Properties of Pooled Time Series Tests, With an Application to the PPP Hypothesis; New Results. Working paper

by Peter Pedroni , 1997
"... We examine properties of residual-based tests for the null of no cointegration for dynamic panels in which both the short-run dynamics and the long-run slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous fixed ..."
Abstract - Cited by 529 (13 self) - Add to MetaCart
and power performance, and we illustrate their use in testing purchasing power parity for the post–Bretton Woods period+ 1.

How bad is selfish routing?

by Tim Roughgarden, Éva Tardos - JOURNAL OF THE ACM , 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract - Cited by 657 (27 self) - Add to MetaCart
traffic such that the sum of all travel times—the total latency—is minimized. In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes

The flooding time synchronization protocol

by Miklos Maroti, Branislav Kusy, Gyula Simon, Akos Ledeczi , 2004
"... Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored for applications requir ..."
Abstract - Cited by 469 (16 self) - Add to MetaCart
periodic radio broadcast of synchronization messages, and implicit dynamic topology update. The unique high precision performance is reached by utilizing MAC-layer time-stamping, comprehensive error compensation, including linear regression, which reduces time skew and keeps network traffic overhead low

A Learning Algorithm for Continually Running Fully Recurrent Neural Networks

by Ronald J. Williams, David Zipser , 1989
"... The exact form of a gradient-following learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a precis ..."
Abstract - Cited by 534 (4 self) - Add to MetaCart
the retention of information over time periods having either fixed or indefinite length. 1 Introduction A major problem in connectionist theory is to develop learning algorithms that can tap the full computational power of neural networks. Much progress has been made with feedforward networks, and attention
Results 1 - 10 of 168,200