Sciweavers

2489 search results - page 142 / 498
» On the Subgroup Distance Problem
Sort
View
136
Voted
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 10 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...
PDC
2004
ACM
15 years 9 months ago
Social creativity: turning barriers into opportunities for collaborative design
Design is a ubiquitous activity. The complexity of design problems requires communities rather than individuals to address, frame, and solve them. These design communities have to...
Gerhard Fischer
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
15 years 4 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
144
Voted
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 4 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
CVPR
2009
IEEE
15 years 1 months ago
Learning IMED via shift-invariant transformation
The IMage Euclidean Distance (IMED) is a class of image metrics, in which the spatial relationship between pixels is taken into consideration. It was shown that calculating the IM...
Bing Sun, Jufu Feng, Liwei Wang