500 search results - page 90 / 100 » A parallel quadratic programming method for dynamic optimiza... |
104
click to vote
IPPS
2009
IEEE
15 years 5 months ago
2009
IEEE
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
DAGSTUHL
2004
15 years 14 days ago
2004
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
165
click to vote
ISCA
2002
IEEE
14 years 10 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
116
Voted
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
98
Voted
PLDI
2010
ACM
15 years 3 months ago
2010
ACM
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...