Sciweavers

502 search results - page 20 / 101
» Popular Mixed Matchings
Sort
View
WWW
2009
ACM
14 years 10 months ago
Online expansion of rare queries for sponsored search
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...
ISPD
1999
ACM
97views Hardware» more  ISPD 1999»
14 years 2 months ago
A methodology to analyze power, voltage drop and their effects on clock skew/delay in early stages of design
This paper presents a methodology to analyze signal integrity such as power voltage drop and clock skew in early stages of design, more specifically, when RTL-design and early flo...
Masato Iwabuchi, Noboru Sakamoto, Yasushi Sekine, ...
FOCS
1999
IEEE
14 years 2 months ago
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
V. S. Anil Kumar, H. Ramesh
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
14 years 3 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
14 years 1 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram