Sciweavers

619 search results - page 9 / 124
» Random Bichromatic Matchings
Sort
View
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 1 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
COMBINATORICS
2004
106views more  COMBINATORICS 2004»
13 years 7 months ago
Random Matrices, Magic Squares and Matching Polynomials
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
Persi Diaconis, Alexander Gamburd
RSS
2007
198views Robotics» more  RSS 2007»
13 years 9 months ago
CRF-Matching: Conditional Random Fields for Feature-Based Scan Matching
— Matching laser range scans observed at different points in time is a crucial component of many robotics tasks, including mobile robot localization and mapping. While existing t...
Fabio T. Ramos, Dieter Fox, Hugh F. Durrant-Whyte
ISCAS
2007
IEEE
120views Hardware» more  ISCAS 2007»
14 years 1 months ago
DPA Using Phase-Based Waveform Matching against Random-Delay Countermeasure
— We propose Differential Power Analysis (DPA) with a phase-based waveform matching technique. Conventionally, a trigger signal and a system clock are used to capture the wavefor...
Sei Nagashima, Naofumi Homma, Yuichi Imai, Takafum...
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...