1224 search results - page 198 / 245 » Concept Search |
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
103
click to vote
SAT
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
120
click to vote
GIR
2007
ACM
15 years 3 months ago
2007
ACM
This paper introduces the concept of spatial filters as an approach to increasing the relevance of the information retrieved by users of mobile information systems. This approach ...
ICAIL
2007
ACM
15 years 3 months ago
2007
ACM
For each industry, there exist many taxonomies that are intended for various applications. There are also multiple sources of regulations from different government agencies. Indus...
102
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 3 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...