Sciweavers

1532 search results - page 138 / 307
» The Symbol Grounding Problem
Sort
View
CP
2003
Springer
15 years 9 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
141
Voted
MICCAI
2009
Springer
16 years 5 months ago
Dynamic Cone Beam Reconstruction Using a New Level Set Formulation
Abstract. This paper addresses an approach toward tomographic reconstruction from rotational angiography data as it is generated by Carms in cardiac imaging. Since the rotational a...
Andreas Keil, Jakob Vogel, Günter Lauritsch, ...
DAC
2009
ACM
16 years 5 months ago
Handling don't-care conditions in high-level synthesis and application for reducing initialized registers
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo
SIGSOFT
2005
ACM
16 years 5 months ago
CUTE: a concolic unit testing engine for C
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
Koushik Sen, Darko Marinov, Gul Agha
124
Voted
DCC
2003
IEEE
16 years 4 months ago
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin W...