Results 1  10
of
1,304,393
Projective Coordinates Leak
, 2003
"... Denoting by P = [k]G the ellipticcurve doubleandadd multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representation of P results in information being revealed about k. ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Denoting by P = [k]G the ellipticcurve doubleandadd multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representation of P results in information being revealed about k.
How to leak a secret
 PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON THE THEORY AND APPLICATION OF CRYPTOLOGY AND INFORMATION SECURITY: ADVANCES IN CRYPTOLOGY
, 2001
"... In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and ..."
Abstract

Cited by 2508 (4 self)
 Add to MetaCart
, and no coordination: any user can choose any set of possible signers that includes himself, and sign any message by using his secret key and the others ’ public keys, without getting their approval or assistance. Ring signatures provide an elegant way to leak authoritative secrets in an anonymous way, to sign casual
The interdisciplinary study of coordination
 ACM Computing Surveys
, 1994
"... This survey characterizes an emerging research area, sometimes called coordination theory, that focuses on the interdisciplinary study of coordination. Research in this area uses and extends ideas about coordination from disciplines such as computer science, organization theory, operations research, ..."
Abstract

Cited by 773 (21 self)
 Add to MetaCart
This survey characterizes an emerging research area, sometimes called coordination theory, that focuses on the interdisciplinary study of coordination. Research in this area uses and extends ideas about coordination from disciplines such as computer science, organization theory, operations research
Vivaldi: A Decentralized Network Coordinate System
 In SIGCOMM
, 2004
"... Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract

Cited by 593 (5 self)
 Add to MetaCart
simple, lightweight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts.
The Coordination of Arm Movements: An Experimentally Confirmed Mathematical Model
 Journal of neuroscience
, 1985
"... This paper presents studies of the coordination of voluntary human arm movements. A mathematical model is formulated which is shown to predict both the qualitative features and the quantitative details observed experimentally in planar, multijoint arm movements. Coordination is modeled mathematic ..."
Abstract

Cited by 663 (18 self)
 Add to MetaCart
This paper presents studies of the coordination of voluntary human arm movements. A mathematical model is formulated which is shown to predict both the qualitative features and the quantitative details observed experimentally in planar, multijoint arm movements. Coordination is modeled
Riskmanagement: coordinating corporate investment and financing policies
, 1993
"... This paper develops a general framework for analyzing corporate risk management policies. We begin by observing that if external sources of finance are more costly to corporations than internally generated funds, there will typically be a benefit to hedging: hedging adds value to the extent that it ..."
Abstract

Cited by 540 (15 self)
 Add to MetaCart
This paper develops a general framework for analyzing corporate risk management policies. We begin by observing that if external sources of finance are more costly to corporations than internally generated funds, there will typically be a benefit to hedging: hedging adds value to the extent that it helps ensure that a corporation has sufficient internal funds available to take advantage of attractive investment opportunities. We then argue that this simple observation has wide ranging implications for the design of risk management strategies. We delineate how these strategies should depend on such factors as shocks to investment and financing opportunities. We also discuss exchange rate hedging strategies for multinationals, as well as strategies involving "nonlinear" instruments like options.
Projection Pursuit Regression
 Journal of the American Statistical Association
, 1981
"... A new method for nonparametric multiple regression is presented. The procedure models the regression surface as a sum of general smooth functions of linear combinations of the predictor variables in an iterative manner. It is more general than standard stepwise and stagewise regression procedures, ..."
Abstract

Cited by 555 (6 self)
 Add to MetaCart
A new method for nonparametric multiple regression is presented. The procedure models the regression surface as a sum of general smooth functions of linear combinations of the predictor variables in an iterative manner. It is more general than standard stepwise and stagewise regression procedures, does not require the definition of a metric in the predictor space, and lends itself to graphical interpretation.
Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks
 IEEE/ACM Transactions on Networking
, 2004
"... This paper proposes SMAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use batteryoperated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract

Cited by 684 (15 self)
 Add to MetaCart
This paper proposes SMAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use batteryoperated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with nodes remaining largely inactive for long time, but becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in several ways: energy conservation and selfconfiguration are primary goals, while pernode fairness and latency are less important. SMAC uses a few novel techniques to reduce energy consumption and support selfconfiguration. It enables lowdutycycle operation in a multihop network. Nodes form virtual clusters based on common sleep schedules to reduce control overhead and enable trafficadaptive wakeup. SMAC uses inchannel signaling to avoid overhearing unnecessary traffic. Finally, SMAC applies message passing to reduce contention latency for applications that require innetwork data processing. The paper presents measurement results of SMAC performance on a sample sensor node, the UC Berkeley Mote, and reveals fundamental tradeoffs on energy, latency and throughput. Results show that SMAC obtains significant energy savings compared with an 802.11like MAC without sleeping.
The homogeneous coordinate ring of a toric variety
, 1992
"... This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X) of ..."
Abstract

Cited by 478 (7 self)
 Add to MetaCart
) of X (where n = dim X). Using this graded ring, we will show that X behaves like projective space in many ways. The paper is organized into four sections as follows. In §1, we define the homogeneous coordinate ring S of X and compute its graded pieces in terms of global sections of certain coherent
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
, 1997
"... We develop a face recognition algorithm which is insensitive to gross variation in lighting direction and facial expression. Taking a pattern classification approach, we consider each pixel in an image as a coordinate in a highdimensional space. We take advantage of the observation that the images ..."
Abstract

Cited by 2263 (18 self)
 Add to MetaCart
We develop a face recognition algorithm which is insensitive to gross variation in lighting direction and facial expression. Taking a pattern classification approach, we consider each pixel in an image as a coordinate in a highdimensional space. We take advantage of the observation that the images
Results 1  10
of
1,304,393