Sciweavers

174 search results - page 25 / 35
» Algorithms for center and Tverberg points
Sort
View
APVIS
2006
13 years 8 months ago
Visualizing multivariate network on the surface of a sphere
A multivariate network is a graph whose nodes contain multi-dimensional attributes. We propose a method to visualize such a network using spherical Self-Organizing Map (SOM) and c...
Yingxin Wu, Masahiro Takatsuka
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 7 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
IWCMC
2006
ACM
14 years 20 days ago
Analysis of mobile beacon aided in-range localization scheme in ad hoc wireless sensor networks
In this paper, We mathematically model the In-Range localization scheme in the presence of a Mobile Beacon. In the In-Range localization scheme, a sensor with unknown location is ...
T. V. Srinath, Anil Kumar Katti, V. S. Ananthanara...
VRST
2004
ACM
14 years 4 days ago
Animating reactive motions for biped locomotion
In this paper, we propose a new method for simulating reactive motions for running or walking human figures. The goal is to generate realistic animations of how humans compensate...
Taku Komura, Howard Leung, James Kuffner
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 10 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...