237 search results - page 33 / 48 » MapReduce for Integer Factorization |
106
click to vote
TAMC
2007
Springer
15 years 7 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
93
Voted
SODA
1997
ACM
15 years 2 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
139
click to vote
COMGEO
2004
ACM
15 years 19 days ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
95
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
211
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...