Sciweavers

1290 search results - page 48 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
SPIRE
2007
Springer
15 years 10 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 8 months ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
FPL
2003
Springer
130views Hardware» more  FPL 2003»
15 years 9 months ago
A Smith-Waterman Systolic Cell
With an aim to understand the information encoded by DNA sequences, databases containing large amount of DNA sequence information are frequently compared and searched for matching ...
Chi Wai Yu, K. H. Kwong, Kin-Hong Lee, Philip Heng...
126
Voted
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
15 years 8 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
ICPR
2006
IEEE
15 years 10 months ago
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a selfadapting matching score that maximizes the number of reliable corre...
Andreas Klaus, Mario Sormann, Konrad F. Karner