876 search results - page 133 / 176 » Complexity in geometric SINR |
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...
FGR
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper, we propose a fast and robust method for tracking a user’s hand and multiple fingertips; we then demonstrate gesture recognition based on measured fingertip traj...
ICRA
2002
IEEE
14 years 2 months ago
2002
IEEE
Abstract—Many applications require continuous monitoring of a moving target by a controllable vision system. Although the goal of tracking objects is not new, traditional techniq...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
Three dimensional triangle mesh is the dominant representation used in parallel rendering of 3D geometric models. However, explosive growth in the complexity of the mesh-based 3D ...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....