1971 search results - page 319 / 395 » Tabu search - Uncharted domains |
169
click to vote
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
15 years 10 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
162
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
192
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
Relational databases are widely used today as a mechanism for providing access to structured data. They, however, are not suitable for typical information finding tasks of end use...
154
click to vote
CIVR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Bag-of-words representation with visual keypoints has recently emerged as an attractive approach for video search. In this paper, we study the degree of improvement when ...
192
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...