Sciweavers

338 search results - page 33 / 68
» Using pattern matching for tiling and packing problems
Sort
View
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
14 years 11 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 1 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
66
Voted
FPL
2000
Springer
122views Hardware» more  FPL 2000»
15 years 1 months ago
A Placement Algorithm for FPGA Designs with Multiple I/O Standards
State-of-the-art FPGAs possess I/O resources that can be configured to support a wide variety of I/O standards [1]. In such devices, the I/O resources are grouped into banks. One o...
Jason Helge Anderson, Jim Saunders, Sudip Nag, Cha...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 1 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
INFSOF
2008
112views more  INFSOF 2008»
14 years 9 months ago
A catalog of architectural primitives for modeling architectural patterns
Architectural patterns are a fundamental aspect of the architecting process and subsequently the architectural documentation. Unfortunately, there is only poor support for modelin...
Uwe Zdun, Paris Avgeriou