6181 search results - page 930 / 1237 » Transactional Cluster Computing |
170
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
205
click to vote
TOG
2012
13 years 8 months ago
2012
Given a large repository of geotagged imagery, we seek to automatically find visual elements, e.g. windows, balconies, and street signs, that are most distinctive for a certain g...
182
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on image pixels, and therefore do not ne...
177
click to vote
IPPS
2007
IEEE
16 years 14 days ago
2007
IEEE
Due to the complexity associated with developing parallel applications, scientists and engineers rely on highlevel software libraries such as PETSc, ScaLAPACK and PESSL to ease th...
146
click to vote
ICS
2005
Tsinghua U.
15 years 11 months ago
2005
Tsinghua U.
As parallel jobs get bigger in size and finer in granularity, “system noise” is increasingly becoming a problem. In fact, fine-grained jobs on clusters with thousands of SMP...