10148 search results - page 1819 / 2030 » Optimal sub-graphical models |
141
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
270
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
161
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
263
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Today's high-performance single-chip CMOS microprocessors are the most complex and challenging chip designs ever implemented. To stay on the leading edge, Digital's micro...
158
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...