Results 1 - 10
of
3,024
LIGHT COORDINATES IN RELATIVITY ∗
"... The construction of coordinate systems by intersection of four beams of light is analyzed. 1 ..."
Abstract
- Add to MetaCart
The construction of coordinate systems by intersection of four beams of light is analyzed. 1
Vivaldi: A Decentralized Network Coordinate System
- In SIGCOMM
, 2004
"... Large-scale Internet applications can benefit from an ability to predict round-trip 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 602 (4 self)
- Add to MetaCart
simple, light-weight 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.
A Secure Routing Protocol for Ad Hoc Networks
, 2002
"... Most recent ad hoc network research has focused on providing routing services without considering security. In this paper, we detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments with distin ..."
Abstract
-
Cited by 508 (0 self)
- Add to MetaCart
Most recent ad hoc network research has focused on providing routing services without considering security. In this paper, we detail security threats against ad hoc routing protocols, specifically examining AODV and DSR. In light of these threats, we identify three different environments
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 high-dimensional space. We take advantage of the observation that the images ..."
Abstract
-
Cited by 2310 (17 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 high-dimensional space. We take advantage of the observation that the images
Many hands make light the work: the cause and consequences of social loafing
- Journal of Personality and Social Psychology
, 1979
"... Two experiments found that when asked to perform the physically exerting tasks of clapping and shouting, people exhibit a sizable decrease in individual effort when performing in groups as compared to when they perform alone. This decrease, which we call social loafing, is in addition to losses due ..."
Abstract
-
Cited by 247 (3 self)
- Add to MetaCart
to faulty co-ordination of group efforts. Social loafing is discussed in terms of its experi-mental generality and theoretical importance. The widespread occurrence, the negative consequences for society, and some conditions that can minimize social loafing are also explored. There is an old saying
Robust Analysis of Feature Spaces: Color Image Segmentation
, 1997
"... A general technique for the recovery of significant image features is presented. The technique is basedon the mean shift algorithm, a simple nonparametric procedure for estimating density gradients. Drawbacks of the current methods (including robust clustering) are avoided. Featurespace of any natu ..."
Abstract
-
Cited by 226 (6 self)
- Add to MetaCart
-based query systems. A 512 x 512 color image is analyzed in less than 10 seconds on a standard workstation. Gray level images are handled as color images having only the lightness coordinate.
Principal manifolds and nonlinear dimensionality reduction via tangent space alignment
- SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 2004
"... Nonlinear manifold learning from unorganized data points is a very challenging unsupervised learning and data visualization problem with a great variety of applications. In this paper we present a new algorithm for manifold learning and nonlinear dimension reduction. Based on a set of unorganized ..."
Abstract
-
Cited by 261 (15 self)
- Add to MetaCart
data points sampled with noise from the manifold, we represent the local geometry of the manifold using tangent spaces learned by fitting an affine subspace in a neighborhood of each data point. Those tangent spaces are aligned to give the internal global coordinates of the data points with respect
Perspective Shadow Maps
- ACM Transactions on Graphics
, 2002
"... Figure 1: (Left) Uniform 512x512 shadow map and resulting image. (Right) The same with a perspective shadow map of the same size. Shadow maps are probably the most widely used means for the generation of shadows, despite their well known aliasing problems. In this paper we introduce perspective shad ..."
Abstract
-
Cited by 193 (9 self)
- Add to MetaCart
shadow maps, which are generated in normalized device coordinate space, i.e., after perspective transformation. This results in important reduction of shadow map aliasing with almost no overhead. We correctly treat light source transformations and show how to include all objects which cast shadows
Results 1 - 10
of
3,024