197 search results - page 22 / 40 » A Parallel Algorithm for Solving Large Convex Minimax Proble... |
115
Voted
SC
2000
ACM
15 years 7 months ago
2000
ACM
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...
131
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We propose the quality-of-service (QoS) driven power allocation schemes for parallel fading channels when considering imperfect channel estimations. In particular, the parallel...
135
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
130
Voted
CLUSTER
2002
IEEE
15 years 7 months ago
2002
IEEE
Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. T...
169
Voted
ICIAP
2005
ACM
15 years 8 months ago
2005
ACM
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signiï¬...