Sciweavers

584 search results - page 38 / 117
» On the Number of Halving Planes
Sort
View
PERCOM
2007
ACM
15 years 9 months ago
Dynamic Carrier-Assisted Routing in Mobile Networks
We propose to use node mobility to enhance routing capability in a mobile network. A dual-control planes model is presented, which includes the traditional S(stationary)-plane for ...
Jie Wu
TSMC
2010
14 years 4 months ago
Adaptive Appearance Model and Condensation Algorithm for Robust Face Tracking
We present an adaptive framework for condensation algorithms in the context of human-face tracking. We attack the face tracking problem by making factored sampling more efficient a...
Yui Man Lui, J. Ross Beveridge, L. Darrell Whitley
DAM
2006
124views more  DAM 2006»
14 years 10 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris
GD
2007
Springer
15 years 4 months ago
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
WG
2004
Springer
15 years 3 months ago
Planar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...