Sciweavers

1477 search results - page 5 / 296
» Pattern Matching with Swaps
Sort
View
ICPR
2010
IEEE
13 years 6 months ago
Matching Groups of People by Covariance Descriptor
In this paper, we present a new solution to the problem of matching groups of people across multiple nonoverlapping cameras. Similar to the problem of matching individuals across ...
Yinghao Cai, Valtteri Takala, Matti Pietikäin...
HPCA
1995
IEEE
13 years 11 months ago
Implementation of Atomic Primitives on Distributed Shared Memory Multiprocessors
In this paper we consider several hardware implementations of the general-purpose atomic primitives fetch and Φ, compare and swap, load linked, and store conditionalon large-scal...
Maged M. Michael, Michael L. Scott
COMPGEOM
1999
ACM
13 years 11 months ago
Geometric Pattern Matching: A Performance Study
In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignm...
Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Sure...
AAAI
2012
11 years 9 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
13 years 12 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...