1322 search results - page 146 / 265 » Parameterized counting problems |
SAC
2003
ACM
14 years 3 months ago
2003
ACM
One of the open problems in the area of domain-specific languages is how to make domain-specific language development easier for domain experts not versed in a programming languag...
IEEEPACT
1998
IEEE
14 years 2 months ago
1998
IEEE
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...
DAC
1994
ACM
14 years 2 months ago
1994
ACM
We present a systematic approach to synthesize an instruction set such that the given application software can be efficiently mapped to a parameterized, pipelined microarchitectur...
CP
2006
Springer
14 years 2 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
ECCV
2006
Springer
14 years 1 months ago
2006
Springer
This paper addresses the problem of articulated motion tracking from image sequences. We describe a method that relies on both an explicit parameterization of the extremal contours...