WACV
2005
IEEE
14 years 5 months ago
2005
IEEE
As interest in 3D face recognition increases the importance of the initial alignment problem does as well. In this paper we present a method utilizing the registered 2D color and ...
SMI
2005
IEEE
2005
IEEE
A Tracing Algorithm for Constructing Medial Axis Transform of 3D Objects Bound by Free-Form Surfaces
14 years 5 months ago
This paper presents an algorithm for generating the Medial Axis Transform(MAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the...
SIBGRAPI
2005
IEEE
14 years 5 months ago
2005
IEEE
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
SIBGRAPI
2005
IEEE
14 years 5 months ago
2005
IEEE
We present an algorithm that creates a mosaic effect for an image in an adaptive and automatic fashion. The algorithm is automatic because it does not need user intervention, exce...
IV
2005
IEEE
14 years 5 months ago
2005
IEEE
Lowering computational cost of data analysis and visualization techniques is an essential step towards including the user in the visualization. In this paper we present an improve...
ISPDC
2005
IEEE
14 years 5 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
IPPS
2005
IEEE
14 years 5 months ago
2005
IEEE
This paper describes a parallel algorithm for correlating or “fusing” streams of data from sensors and other sources of information. The algorithm is useful for applications w...
IPPS
2005
IEEE
14 years 5 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
IPPS
2005
IEEE
14 years 5 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
INFOCOM
2005
IEEE
14 years 5 months ago
2005
IEEE
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform rand...