1525 search results - page 53 / 305 » Matching with Regular Constraints |
133
Voted
FGCS
2006
15 years 3 months ago
2006
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
142
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper addresses a key bottleneck in the use of the 3D medial axis (MA) representation, namely, how the complex MA structure can be regularized so that similar, within-categor...
128
click to vote
CVPR
2010
IEEE
16 years 6 hour ago
2010
IEEE
Two challenges in computer vision are to accommodate noisy data and missing data. Many problems in computer vision, such as segmentation, filtering, stereo, reconstruction, inpain...
110
Voted
DATE
2003
IEEE
2003
IEEE
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
15 years 8 months ago
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
131
Voted
NIPS
2008
15 years 5 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...