Results 1 - 10 of 418

Avoiding Unnecessary Updates

by John Launchbury, Andy Gill, John Hughes, Simon Marlow, Simon Peyton Jones, Philip Wadler - In Glasgow Workshop on Functional Programming
"... Graph reduction underlies most implementations of lazy functional languages, allowing separate computations to share results when subterms are evaluated. Once a term is evaluated, the node of the graph representing the computation is updated with the value of the term. However, in many cases, no oth ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
, no other computation requires this value, so the update is unnecessary. In this paper we take some steps towards an analysis for determining when these updates may be omitted. 1 Introduction There are two obvious ways to reduce lambda expressions: outside-in or insideout. The former is called normal

A Linear-Time Heuristic for Improving Network Partitions

by C. M. Fiduccia, et al. , 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract - Cited by 524 (0 self) - Add to MetaCart
for the best cell to move and to minimize unnecessary updating of cells affected by each move.

Strict detailed balance is unnecessary in Monte Carlo simulations

by Vasilios I. Manousiouthakis, Michael W. Deem - J. Chem Phys , 1999
"... Detailed balance is an overly strict condition to ensure a valid Monte Carlo simulation. We show that, under fairly general assumptions, a Monte Carlo simulation need satisfy only the weaker balance condition. Not only does our proof show that sequential updating schemes are correct, but also it est ..."
Abstract - Cited by 19 (0 self) - Add to MetaCart
Detailed balance is an overly strict condition to ensure a valid Monte Carlo simulation. We show that, under fairly general assumptions, a Monte Carlo simulation need satisfy only the weaker balance condition. Not only does our proof show that sequential updating schemes are correct, but also

Fast Incremental Maintenance of Approximate Histograms

by Phillip B. Gibbons, Yossi Matias, Viswanath Poosala , 1997
"... Many commercial database systems maintain histograms to summarize the contents of large relations and permit efficient estimation of query result sizes for use in query optimizers. Delaying the propagation of database updates to the histogram often introduces errors in the estimation. This paper pre ..."
Abstract - Cited by 183 (19 self) - Add to MetaCart
presents new sampling-based approaches for incremental maintenance of approximate histograms. By scheduling updates to the histogram based on the updates to the database, our techniques are the first to maintain histograms effectively up-to-date at all times and avoid computing overheads when unnecessary

IP Paging Considered Unnecessary: Mobile IPv6 and IP Paging for Dormant Mode Location Update in Macrocellular and Hotspot Networks

by James Kempf, Pars Mutaf, Planete Team
"... Cellular telephones save power by switching to a low power, or dormant, mode when there is no active traffic. In dormant mode, the telephone periodically checks for a beacon, and if the beacon indicates that the phone has moved to a new paging area, the telephone performs a paging area update. Pagin ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Cellular telephones save power by switching to a low power, or dormant, mode when there is no active traffic. In dormant mode, the telephone periodically checks for a beacon, and if the beacon indicates that the phone has moved to a new paging area, the telephone performs a paging area update

iSAM: Incremental Smoothing and Mapping

by Michael Kaess, Ananth Ranganathan, Frank Dellaert , 2008
"... We present incremental smoothing and mapping (iSAM), a novel approach to the simultaneous localization and mapping problem that is based on fast incremental matrix factorization. iSAM provides an efficient and exact solution by updating a QR factorization of the naturally sparse smoothing informatio ..."
Abstract - Cited by 153 (35 self) - Add to MetaCart
We present incremental smoothing and mapping (iSAM), a novel approach to the simultaneous localization and mapping problem that is based on fast incremental matrix factorization. iSAM provides an efficient and exact solution by updating a QR factorization of the naturally sparse smoothing

Data Management in Real-Time Systems: a Case of On-Demand Updates in Vehicle Control Systems

by Thomas Gustafsson, Jörgen Hansson - In Proceedings of Real-time Applications symposium (RTAS , 2004
"... Real-time and embedded applications normally have constraints both with respect to timeliness and freshness of data they use. At the same time it is important that the resources are utilized as efficient as possible, e.g., for CPU resources unnecessary calculations should be lowered as much as possi ..."
Abstract - Cited by 34 (8 self) - Add to MetaCart
as possible. This is especially true for vehicle control systems, which are our targeting application area. The contribution of this paper is a new algorithm (ODTB) for updating data items that can skip unnecessary updates allowing for better utilization of the CPU. Performance evaluations on an engine

LOCATION UPDATION FOR ENERGY EFFICIENT GEOGRAPHIC ROUTING IN

by unknown authors
"... Routing in mobile ad-hoc networks with a large number of nodes or with high mobility is a very difficult task and energy conservation is very important for mobile devices. In geographic routing each node require information about neighbors to forward data packets. Earlier periodic updations are used ..."
Abstract - Add to MetaCart
are used for location updation but it consumes much amount of node energy and bandwidth utilized for unnecessary updation where there is no changes in the location information. In this paper adaptive position update used with less energy consumption and utilize the bandwidth for location updation only when

Incremental Dynamic Updates

by First-class Contexts
"... Abstract Highly available software systems occasionally need to be updated while avoiding downtime. Dynamic software updates reduce downtime, but still require the system to reach a quiescent state in which a global update can be performed. This can be difficult for multi-threaded systems. We presen ..."
Abstract - Add to MetaCart
present a novel approach to dynamic updates using first-class contexts, called Theseus. First-class contexts make global updates unnecessary: existing threads run to termination in an old context, while new threads start in a new, updated context; consistency between contexts is ensured with the help

CQ: A Personalized Update Monitoring Toolkit

by Ling Liu, Calton Pu, Wei Tang, David Buttler, John Biggs, Tong Zhou, Paul Benninghoff, Wei Han - In Proceedings of ACM SIGMOD Conference , 1998
"... Introduction The World Wide Web (WWW) made an unprecedented amount and variety of data accessible to all Internet users. However, users suffer from information starvation under this data overload, due to the daunting challenge of navigating, collecting, evaluating, and processing data in this dynam ..."
Abstract - Cited by 26 (14 self) - Add to MetaCart
it reduces the time users spend hunting for the updated information as well as unnecessary traffic on the net. The CQ project at OGI, funded by DARPA, aims at developing a scalable toolkit and techniques for update monitoring and event-driven information delivery on the net. The main feature of the CQ
Results 1 - 10 of 418