73 search results - page 5 / 15 » There are no Barker arrays having more than two dimensions |
FCCM
2011
IEEE
13 years 4 days ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
PIMRC
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
AAAI
2007
13 years 10 months ago
2007
A traditional goal of Artificial Intelligence research has been a system that can read unrestricted natural language texts on a given topic, build a model of that topic and reason...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
TIT
2002
13 years 8 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...