1272 search results - page 66 / 255 » Approximate Parameterized Matching |
298
click to vote
WADS
2009
Springer
16 years 22 days ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
155
click to vote
CONIELECOMP
2005
IEEE
15 years 11 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
167
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
190
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
161
click to vote
FPL
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...