Sciweavers

450 search results - page 53 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
PODC
2005
ACM
15 years 5 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
ICMI
2004
Springer
152views Biometrics» more  ICMI 2004»
15 years 5 months ago
Exploiting prosodic structuring of coverbal gesticulation
Although gesture recognition has been studied extensively, communicative, affective, and biometrical “utility” of natural gesticulation remains relatively unexplored. One of t...
Sanshzar Kettebekov
IVC
2000
179views more  IVC 2000»
14 years 11 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
SECON
2010
IEEE
14 years 9 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
ICCV
2005
IEEE
16 years 1 months ago
Shape and Appearance Repair for Incomplete Point Surfaces
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...
Seyoun Park, Xiaohu Guo, Hayong Shin, Hong Qin