6181 search results - page 956 / 1237 » Transactional Cluster Computing |
168
click to vote
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper presents a low-cost tracking algorithm based on multiple multiple fragments, increasing robustness with respect to partial occlusions. Given the initial template repres...
156
click to vote
DASFAA
2009
IEEE
15 years 12 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
183
click to vote
CORR
2011
Springer
15 years 3 days ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
136
click to vote
TIP
2011
15 years 1 days ago
2011
—Recently, in a previous work, we proposed a way to bound how well any given image can be denoised. The bound was computed directly from the noise-free image that was assumed to ...
181
click to vote
TNN
2010
14 years 11 months ago
2010
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...