Sciweavers

10997 search results - page 135 / 2200
» On the Structure of Complete Sets
Sort
View
DCG
1998
80views more  DCG 1998»
15 years 5 months ago
Fitting a Set of Points by a Circle
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink
DCC
2008
IEEE
16 years 5 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
15 years 11 months ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara
ICRA
2007
IEEE
151views Robotics» more  ICRA 2007»
16 years 15 days ago
A Spatially Structured Genetic Algorithm over Complex Networks for Mobile Robot Localisation
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
HICSS
2007
IEEE
108views Biometrics» more  HICSS 2007»
16 years 16 days ago
Human Computer Interaction in the Pre-Hospital Setting
This paper describes the human computer interface of a new emergency medical services application, which uses several emerging technologies to clarify the inherent complexity and ...
Mark Gaynor, Dan Myung, Raj Patel, Steve Moulton