Sciweavers

4761 search results - page 564 / 953
» Generalizing Boundary Points
Sort
View
DM
2007
74views more  DM 2007»
15 years 6 months ago
Parameters for which the Griesmer bound is not sharp
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
Andreas Klein, Klaus Metsch
ECCC
2007
96views more  ECCC 2007»
15 years 6 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
ENTCS
2007
79views more  ENTCS 2007»
15 years 6 months ago
Towards Trustworthy Spatial Messaging
Spatial messaging is a term that defines the virtual publication of data in physical places. Generally, anyone in the neighborhood of such a publication point gets the message. F...
Michel Deriaz, Jean-Marc Seigneur
KI
2006
Springer
15 years 6 months ago
Active Monte Carlo Recognition
In this paper we introduce Active Monte Carlo Recognition (AMCR), a new approach for object recognition. The method is based on seeding and propagating "relational" part...
Felix von Hundelshausen, Manuela M. Veloso
FUIN
2007
85views more  FUIN 2007»
15 years 6 months ago
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems
Different generalizations to the case of coverings of the standard approach to entropy applied to partitions of a finite universe X are explored. In the first approach any cover...
Daniela Bianucci, Gianpiero Cattaneo, Davide Ciucc...