Sciweavers

71 search results - page 5 / 15
» Touring a sequence of polygons
Sort
View
ESA
2007
Springer
133views Algorithms» more  ESA 2007»
14 years 1 months ago
Order Statistics in the Farey Sequences in Sublinear Time
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
Jakub Pawlewicz
SAC
2006
ACM
13 years 7 months ago
A new method of generating synchronizable test sequences that detect output-shifting faults based on multiple UIO sequences
The objective of testing is to determine the conformance between a system and its specification. When testing distributed systems, the existence of multiple testers brings out the...
Kai Chen, Fan Jiang, Chuan-dong Huang
PR
2010
124views more  PR 2010»
13 years 5 months ago
The regular polygon detector
We present a new interest point operator based on the regular polygon detector developed by Loy and Barnes [2004]. This operator finds square-like features as a basis for scene r...
Nick Barnes, Gareth Loy, David Shaw
ISCIS
2009
Springer
14 years 2 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
EJC
2008
13 years 7 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour