Sciweavers

3244 search results - page 8 / 649
» On convex complexity measures
Sort
View
CORR
2002
Springer
93views Education» more  CORR 2002»
14 years 9 months ago
On the Reflexivity of Point Sets
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
Esther M. Arkin, Sándor P. Fekete, Ferran H...
GD
2009
Springer
15 years 25 days ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 1 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...
66
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Efficient semidefinite relaxation for robust geolocation of unknown emitter by a satellite cluster using TDOA and FDOA measureme
In this paper, we consider the problem of geolocating an unknown emitter by a satellite cluster. We formulate the problem as the maximum likelihood location estimation by using TD...
Kehu Yang, Lizhong Jiang, Zhi-Quan Luo
IJAR
2008
140views more  IJAR 2008»
14 years 9 months ago
Financial risk measurement with imprecise probabilities
Although financial risk measurement is a largely investigated research area, its relationship with imprecise probabilities has been mostly overlooked. However, risk measures can b...
Paolo Vicig