1773 search results - page 251 / 355 » A new partitioning scheme for improvement of image computati... |
197
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Given a single image of an arbitrary road, that may not
be well-paved, or have clearly delineated edges, or some
a priori known color or texture distribution, is it possible
for...
149
click to vote
CGF
2010
14 years 10 months ago
2010
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
117
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
IPL
2002
15 years 1 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...