Sciweavers

174 search results - page 9 / 35
» Algorithms for center and Tverberg points
Sort
View
COMPGEOM
2010
ACM
14 years 14 days ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
SIGCOMM
2009
ACM
14 years 1 months ago
PortLand: a scalable fault-tolerant layer 2 data center network fabric
This paper considers the requirements for a scalable, easily manageable, fault-tolerant, and efficient data center network fabric. Trends in multi-core processors, end-host virtua...
Radhika Niranjan Mysore, Andreas Pamboris, Nathan ...
IVC
2006
81views more  IVC 2006»
13 years 7 months ago
A robust method to recognize critical configuration for camera calibration
When space points and camera optical center lie on a twisted cubic, no matter how many pairs there are used from the space points to their image points, camera parameters cannot b...
Yihong Wu, Zhanyi Hu
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
13 years 7 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 8 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz