4480 search results - page 391 / 896 » Prototyping Completion with Constraints Using Computational ... |
180
click to vote
DSD
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a high-level synthesis flow for mapping an algorithm description (in C) to a provably equivalent registertransfer level (RTL) description of hardware. This flow uses an ...
190
Voted
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
—In this paper we propose an approach for the problem of single channel source separation of speech and music signals. Our approach is based on representing each source’s power...
133
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
207
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
179
click to vote
ICFEM
2004
Springer
16 years 3 days ago
2004
Springer
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...