2219 search results - page 130 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
129
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
163
Voted
ISPD
2012
ACM
13 years 10 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
117
Voted
ICPP
1994
IEEE
15 years 6 months ago
1994
IEEE
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
130
Voted
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
136
click to vote
JMLR
2010
15 years 28 days ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...