Sciweavers

1405 search results - page 47 / 281
» Popularity at Minimum Cost
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Invited Paper: A Compile-time Cost Model for OpenMP
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. It is also a promising candidate to exploit the emer...
Chunhua Liao, Barbara M. Chapman
PPPJ
2006
ACM
15 years 3 months ago
Cost and benefit of rigorous decoupling with context-specific interfaces
In Java programs, classes are coupled to each other through the use of typed references. In order to minimize coupling without changing the executed code, interfaces can be introd...
Florian Forster
86
Voted
DEBS
2007
ACM
15 years 1 months ago
Modeling the communication costs of content-based routing: the case of subscription forwarding
Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe. Despite its popularity, however, ...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
77
Voted
DAC
2004
ACM
15 years 10 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
CVPR
2004
IEEE
15 years 11 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell