74 search results - page 6 / 15 » Algorithms for Generating Convex Sets in Acyclic Digraphs |
88
Voted
ASPDAC
2008
ACM
15 years 2 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
89
Voted
DAC
1996
ACM
15 years 4 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
104
Voted
ICCAD
2001
IEEE
15 years 9 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
116
Voted
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In content-based image retrieval (CBIR) and image screening, it is often desirable to locate the regions of interest (ROI) in the images automatically. This can be accomp...