845 search results - page 127 / 169 » Complexity Dimensions and Learnability |
HT
1996
ACM
14 years 19 days ago
1996
ACM
Computing support forlargeengineeringenterprisesprovides an example of the need for hypermedia-based collaborative computing systems composed of a large number of distributed hete...
IPPS
1993
IEEE
14 years 18 days ago
1993
IEEE
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
IPPS
1994
IEEE
14 years 18 days 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 ...
APWEB
2006
Springer
14 years 7 days ago
2006
Springer
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
FOCS
2004
IEEE
14 years 6 days ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...