Sciweavers

514 search results - page 26 / 103
» Approximate Periods of Strings
Sort
View
ISCAS
2005
IEEE
159views Hardware» more  ISCAS 2005»
14 years 1 months ago
A Fourier series-based RLC interconnect model for periodic signals
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
Guoqing Chen, Eby G. Friedman
IPL
2008
90views more  IPL 2008»
13 years 8 months ago
On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings
Generalized Petersen (GP) networks and periodically regular chordal (PRC) rings have been proposed independently to ameliorate the high latency and extreme fragility of simple rin...
Behrooz Parhami
MFCS
2005
Springer
14 years 1 months ago
Explicit Inapproximability Bounds for the Shortest Superstring Problem
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
Virginia Vassilevska
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
14 years 8 days ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
HOTOS
2007
IEEE
13 years 11 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer