740 search results - page 118 / 148 » Lower bounds for Buchsbaum* complexes |
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...
160
click to vote
ALENEX
2010
15 years 7 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
138
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
154
click to vote
IM
2007
15 years 6 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
154
click to vote
DSD
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...