Results 1 - 10 of 1,446

Disseminating Active Map Information to Mobile Hosts

by Bill N. Schilit, Marvin M. Theimer , 1994
"... Mobile computing differs from desk-top computing because of the dynamic nature of system state: as users move, the sets of stationary and mobile objects they control and the types of information they wish to access change. Navigating a mobile environment can be aided by active maps that describe ..."
Abstract - Cited by 342 (2 self) - Add to MetaCart
the location and characteristics of objects within some region as they change over time. We describe an active map service that keeps clients informed of changes in their environment. The primary issue driving our design is the question of scale: an active map service must be able to handle updates

Near-optimal sensor placements in gaussian processes

by Andreas Krause, Ajit Singh, Carlos Guestrin, Chris Williams - In ICML , 2005
"... When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to address this task, for example, geometry or disk models, placing sensors at the points of highest entropy (variance) in t ..."
Abstract - Cited by 342 (34 self) - Add to MetaCart
) in the GP model, and A-, D-, or E-optimal design. In this paper, we tackle the combinatorial optimization problem of maximizing the mutual information between the chosen locations and the locations which are not selected. We prove that the problem of finding the configuration that maximizes mutual

A Survey and Comparison of Peer-to-Peer Overlay Network Schemes

by Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma, Steven Lim - IEEE COMMUNICATIONS SURVEYS AND TUTORIALS , 2005
"... Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they ..."
Abstract - Cited by 302 (1 self) - Add to MetaCart
or guarantees, hierarchical naming, trust and authentication, and, anonymity. P2P networks potentially offer an efficient routing architecture that is self-organizing, massively scalable, and robust in the wide-area, combining fault tolerance, load balancing and explicit notion of locality. In this paper, we

Spatial gossip and resource location protocols

by David Kempe, Jon Kleinberg, Alan Demers , 2001
"... The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying d ..."
Abstract - Cited by 174 (8 self) - Add to MetaCart
be able to learn about this information with a delay that grows slowly with d, and is independent of the size of the network. For nodes arranged with uniform density in Euclidean space, we present natural gossip mechanisms, called spatial gossip, that satisfy such a guarantee: new information is spread to

PROACTIVE SECRET SHARING Or: How to Cope With Perpetual Leakage

by Amir Herzberg, Stanisław Jarecki, Hugo Krawczyk, Moti Yung , 1998
"... Secret sharing schemes protect secrets by distributing them over different locations (share holders). In particular, in k out of n threshold schemes, security is assured if throughout the entire life-time of the secret the adversary is restricted to compromise less than k of the n locations. For ..."
Abstract - Cited by 231 (13 self) - Add to MetaCart
the secret after the shares are renewed. Hence, the adversary willing to learn the secret needs to break to all k locations during the same time period (e.g., one day, a week, etc.). Furthermore, in order to guarantee the availability and integrity of the secret, we provide mechanisms to detect

Authentication ∗

by Ewa Syta, David Wolinsky, Michael J. Fischer, Abraham Silberschatz, Bryan Ford, Gina Gallegos-garcía, Ewa Syta, David Wolinsky, Michael Fischer, Abraham Silberschatz, Bryan Ford, Gina Gallegos-garcía
"... Biometric authentication offers many benefits ranging from strong security guarantees to user convenience, but remote authentication poses unique challenges to the security and privacy of biometric templates. Current schemes use either unprotected biometric templates, making them directly available ..."
Abstract - Add to MetaCart
Biometric authentication offers many benefits ranging from strong security guarantees to user convenience, but remote authentication poses unique challenges to the security and privacy of biometric templates. Current schemes use either unprotected biometric templates, making them directly available

Authenticated by

by Bureau Of Land Management, Or- P, Ems Transmission, John K. Keith, Heather Gisch , 2003
"... The use of Automated External Defibrillators (AEDs) can save the lives of employees who experience cardiac arrest while on the job. Each year 300,000 to 400,000 individuals die from cardiac arrest. Most cardiac arrest deaths occur outside the hospital. Current out-of-hospital survival rates are 1 to ..."
Abstract - Add to MetaCart
and oversight, locations of AED units, and information regarding liability. Please contact Peggy Tribble, OSO Safety and Health Program Manager at 503-808-6202, for questions or additional information. Districts with Unions are reminded to notify their unions of this IB and satisfy any bargaining obligations

Face Authentication with Gabor Information On Deformable Graphs

by Benoît Duc, Stefan Fischer, Josef Bigün - IEEE TRANS. IMAGE PROCESSING , 1999
"... Elastic graph matching has been proposed as a practical implementation of dynamic link matching, which is a neural network with dynamically evolving links between a reference model and an input image. Each node of the graph contains features that characterize the neighborhood of its location in the ..."
Abstract - Cited by 106 (6 self) - Add to MetaCart
Elastic graph matching has been proposed as a practical implementation of dynamic link matching, which is a neural network with dynamically evolving links between a reference model and an input image. Each node of the graph contains features that characterize the neighborhood of its location

A PRACTICAL ALGORITHM for Exact Array Dependence Analysis

by William Pugh , 1992
"... A fundamental analysis step in advanced optimizing compiler (as well as many other software tools) is data dependence analysis for arrays. This means deciding if two references to an array can refer to the same element and if so, under what conditions. This information is used to deter-mine allowabl ..."
Abstract - Cited by 196 (0 self) - Add to MetaCart
A fundamental analysis step in advanced optimizing compiler (as well as many other software tools) is data dependence analysis for arrays. This means deciding if two references to an array can refer to the same element and if so, under what conditions. This information is used to deter

Location-Based Pairwise Key Establishments for Static Sensor Networks

by Donggang Liu, Peng Ning - In 2003 ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN ’03 , 2003
"... Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversaries. Establishment of pairwise keys is a fundamental security service, which forms the basis of other security services s ..."
Abstract - Cited by 145 (7 self) - Add to MetaCart
predistribution scheme and a location-based pairwise keys scheme using bivariate polynomials, by taking advantage of sensors' expected locations. The analysis in this paper indicates that these schemes can achieve better performance if such location information is available and that the smaller
Results 1 - 10 of 1,446