Sciweavers

249 search results - page 23 / 50
» Finding Patterns in Given Intervals
Sort
View
CIARP
2006
Springer
13 years 10 months ago
A Probabilistic Approach to Build 2D Line Based Maps from Laser Scans in Indoor Environments
In this work we consider a mobile robot with a laser range finder. Our goal is to find the best set of lines from the sequence of points given by a laser scan. We propose a probabi...
Leonardo Romero, Carlos Lara
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
13 years 8 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
BIRD
2007
Springer
14 years 13 days ago
Fast Search Algorithms for Position Specific Scoring Matrices
Fast search algorithms for finding good instances of patterns given as position specific scoring matrices are developed, and some empirical results on their performance on DNA sequ...
Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
RSA
2006
91views more  RSA 2006»
13 years 8 months ago
Average case analysis of the Boyer-Moore algorithm
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
Tsung-Hsi Tsai
IADIS
2004
13 years 9 months ago
Mining Relaxed Graph Properties in Internet
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
Wilhelmiina Hämäläinen, Hannu Toivo...