Sciweavers

4767 search results - page 297 / 954
» Moving between Contexts
Sort
View
VMV
2008
151views Visualization» more  VMV 2008»
15 years 8 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
AAAI
2004
15 years 8 months ago
Task Allocation via Self-Organizing Swarm Coalitions in Distributed Mobile Sensor Network
This paper presents a task allocation scheme via selforganizing swarm coalitions for distributed mobile sensor network coverage. Our approach uses the concepts of ant behavior to ...
Kian Hsiang Low, Wee Kheng Leow, Marcelo H. Ang Jr...
CARS
2004
15 years 8 months ago
Hybrid method for both calibration and registration of an endoscope with an active optical tracker
In this paper, we present a hybrid method for calibration of an endoscope and its registration with an active optical tracker. Practically, both operations are done simultaneously...
Gaëtan Marti, Vincent Bettschart, Jean-S&eacu...
153
Voted
CCCG
2006
15 years 8 months ago
On Bipartite Matching under the RMS Distance
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
Jeff M. Phillips, Pankaj K. Agarwal
DICTA
2003
15 years 8 months ago
Separating a Colour Texture from an Arbitrary Background
Partially supervised segmentation, that is, segmentation with always incomplete training data has many practical applications in image analysis and retrieval. This paper proposes a...
Linjiang Yu, Georgy L. Gimel'farb