Sciweavers

450 search results - page 59 / 90
» Quadrangulations of Planar Sets
Sort
View
VMV
2001
86views Visualization» more  VMV 2001»
13 years 10 months ago
Segmentation of Range Images through the Integration of Different Strate Gies
Segmentation of range images has long been considered an important and difficult problem and continues to attract the attention of researchers in computer vision. In this paper we...
Mary Ellen Bock, Concettina Guerra
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 9 months ago
Path Loss Exponent Estimation in Large Wireless Networks
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
Sunil Srinivasa, Martin Haenggi
EJC
2010
13 years 9 months ago
Partial covers of PG(n, q)
In this paper, we investigate some properties of partial covers of PG(n, q). We show that a set of q + a hyperplanes, q 81, a < (q - 1)/3, or q > 13 and a (q - 10)/4, that...
Stefan M. Dodunekov, Leo Storme, Geertrui Van de V...
JGT
2008
103views more  JGT 2008»
13 years 9 months ago
Game coloring the Cartesian product of graphs
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
Xuding Zhu
JCO
2010
169views more  JCO 2010»
13 years 7 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu