Sciweavers

18 search results - page 2 / 4
» On a sphere that passes through n lattice points
Sort
View
ISVD
2007
IEEE
14 years 19 days ago
Time Convex Hull with a Highway
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
Teng-Kai Yu, D. T. Lee
COMPGEOM
2000
ACM
13 years 10 months ago
Multivariate regression depth
The regression depth of a hyperplane with respect to a set of n points in Rd is the minimum number of points the hyperplane must pass through in a rotation to vertical. We general...
Marshall W. Bern, David Eppstein
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 6 months ago
Even Astral Configurations
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
Leah Wrenn Berman
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 7 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
ICIAP
1999
ACM
13 years 10 months ago
Random Walk Approach to Image Enhancement
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
Bogdan Smolka, Konrad W. Wojciechowski, Marek Szcz...