Sciweavers

1245 search results - page 123 / 249
» Triangulation for Points on Lines
Sort
View
GLOBECOM
2007
IEEE
16 years 23 days ago
Multiple Antenna Time Reversal Transmission in Ultra-Wideband Communications
— In this paper we study the multiple antenna time reversal downlink transmission in an ultra-wideband (UWB) communication system which consists of access points and users. The a...
Yuanwei Jin, Yi Jiang, José M. F. Moura
VRML
1997
ACM
15 years 10 months ago
QOTA: A Fast, Multi-Purpose Algorithm for Terrain Following in Virtual Environments
To keep avatars and other moving objects on the ground in virtual environments, it is necessary to find the points where these objects should contact the terrain. This is often do...
John W. Barrus, Richard C. Waters
CCCG
2009
15 years 7 months ago
Colored Simultaneous Geometric Embeddings and Universal Pointsets
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
IPL
2006
86views more  IPL 2006»
15 years 6 months ago
On the relationship between squared pairings and plain pairings
In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for ...
Bo Gyeong Kang, Je Hong Park
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 6 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri