4171 search results - page 688 / 835 » Choice numbers of graphs |
174
click to vote
ACISP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
170
click to vote
HPCA
2000
IEEE
15 years 11 months ago
2000
IEEE
With increasing chip densities, future microprocessor designs have the opportunity to integrate many of the traditional systemlevel modules onto the same chip as the processor. So...
148
click to vote
HPCA
2000
IEEE
15 years 11 months ago
2000
IEEE
Growth and usage trends for large decision support databases indicate that there is a need for architectures that scale the processing power as the dataset grows. To meet this nee...
214
click to vote
ICPP
2000
IEEE
15 years 11 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
170
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...