Sciweavers

1261 search results - page 47 / 253
» Approximation algorithms for aligning points
Sort
View
70
Voted
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 1 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
IPL
2006
116views more  IPL 2006»
14 years 9 months ago
Guarding galleries and terrains
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
Alon Efrat, Sariel Har-Peled
CVPR
2006
IEEE
15 years 3 months ago
3D Face Recognition Using 3D Alignment for PCA
This paper presents a 3D approach for recognizing faces based on Principal Component Analysis (PCA). The approach addresses the issue of proper 3D face alignment required by PCA f...
Trina Russ, Chris Boehnen, Tanya Peters
60
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ICCSA
2004
Springer
15 years 3 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson