716 search results - page 20 / 144 » Algorithmic Issues in Coding Theory |
130
click to vote
TVCG
2012
13 years 4 months ago
2012
—The broad goals of verifiable visualization rely on correct algorithmic implementations. We extend a framework for verification of isosurfacing implementations to check topologi...
113
click to vote
KI
2001
Springer
15 years 6 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
122
Voted
IJCAI
2003
15 years 3 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
137
Voted
FPGA
2008
ACM
15 years 3 months ago
2008
ACM
We present an in-depth analysis of the Xilinx bitstream format. The information gathered in this paper allows bitstream compilation and decompilation. While not actually compromis...
108
click to vote
TCS
1998
15 years 2 months ago
1998
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...