Sciweavers

565 search results - page 34 / 113
» Geometry of Upper Probabilities
Sort
View
COMPGEOM
1996
ACM
13 years 11 months ago
New Lower Bounds for Convex Hull Problems in Odd Dimensions
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
Jeff Erickson
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
13 years 11 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
COMPGEOM
2005
ACM
13 years 9 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
NIPS
2003
13 years 9 months ago
A Computational Geometric Approach to Shape Analysis in Images
We present a geometric approach to statistical shape analysis of closed curves in images. The basic idea is to specify a space of closed curves satisfying given constraints, and e...
Anuj Srivastava, Xiuwen Liu, Washington Mio, Eric ...
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 7 months ago
Performance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Vite...
Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapak...