5302 search results - page 315 / 1061 » Learning How to Separate |
143
click to vote
VMV
2008
15 years 8 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
171
click to vote
EHCI
2001
15 years 8 months ago
2001
We present a way of analyzing sensed context information formulated to help in the generation, documentation and assessment of the designs of context-aware applications. Starting w...
227
click to vote
ACMDIS
2010
ACM
15 years 7 months ago
2010
ACM
This two-day workshop brings together the interdisciplinary community of scholars and practitioners involved in the design of interactive systems and sharing a common interest in ...
174
click to vote
APIN
2010
15 years 6 months ago
2010
The objective of this paper is to investigate how a Danger Theory based Artificial Immune System--in particular the Dendritic Cell Algorithm (DCA) can detect an attack on a sensor ...
174
click to vote
DCG
2008
15 years 6 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...