10988 search results - page 248 / 2198 » Algorithmic Folding Complexity |
122
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
128
click to vote
DGCI
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
124
click to vote
AAAI
2008
15 years 6 months ago
2008
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
113
click to vote
APWEB
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
145
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...