Sciweavers

10995 search results - page 216 / 2199
» Positioning
Sort
View
PRL
2006
95views more  PRL 2006»
15 years 6 months ago
Where physically is the optical center?
A simple and fast method of determining the position of the optical center without any specialized equipment is presented. The position of the optical center is a depth determinin...
Peter Peer, Franc Solina
COMGEO
2004
ACM
15 years 6 months ago
A lower bound on the number of triangulations of planar point sets
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
Oswin Aichholzer, Ferran Hurtado, Marc Noy
COMBINATORICA
2000
157views more  COMBINATORICA 2000»
15 years 6 months ago
Concentration of Multivariate Polynomials and Its Applications
Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in ti's with positive coefficients. We give a conditi...
Jeong Han Kim, Van H. Vu
149
Voted
DAM
2002
90views more  DAM 2002»
15 years 6 months ago
k-Subdomination in graphs
For a positive integer k, a k-subdominating function of a graph G = (V; E) is a function f : V {-1; 1} such that uNG[v] f(u)
Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh
178
Voted
EATCS
2002
100views more  EATCS 2002»
15 years 6 months ago
Bead-Sort: A Natural Sorting Algorithm
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In...
Joshua J. Arulanandham, Cristian Calude, Michael J...