197 search results - page 31 / 40 » A Parallel Algorithm for Solving Large Convex Minimax Proble... |
129
Voted
ESA
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
113
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
159
Voted
ICPPW
2009
IEEE
15 years 9 months ago
2009
IEEE
—In this paper, we consider joint optimization of end-to-end data transmission and resource allocation for Wireless-Infrastructured Distributed Cellular Networks (WIDCNs), where ...
94
Voted
SWAT
1992
Springer
15 years 6 months ago
1992
Springer
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
169
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We present a simple, accurate, and flexible method to calibrate intrinsic parameters of a camera together with (possibly significant) lens distortion. This new method can work u...