6274 search results - page 1088 / 1255 » From query complexity to computational complexity |
200
click to vote
PR
2007
15 years 6 months ago
2007
In this paper, a novel method for accurate subject tracking, by selecting only tracked subject boundary edges in a video stream with a changing background and moving camera, is pr...
226
click to vote
IACR
2011
14 years 6 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
205
click to vote
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
?This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contribut...
201
click to vote
SMA
2003
ACM
16 years 5 days ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
213
click to vote
ICPADS
1994
IEEE
15 years 11 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...