577 search results - page 75 / 116 » Smartsockets: solving the connectivity problems in grid comp... |
COMPGEOM
1990
ACM
14 years 24 days ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
HAID
2009
Springer
13 years 6 months ago
2009
Springer
In this paper a number of examples are presented of how haptic and auditory feedback can be used for deictic referencing in collaborative virtual environments. Haptic feedback supp...
DAM
1999
13 years 8 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
SCALESPACE
2009
Springer
14 years 3 months ago
2009
Springer
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...