6575 search results - page 134 / 1315 » Specializing visualization algorithms |
144
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...
168
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
169
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
153
click to vote
WDAG
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
156
click to vote
WADS
2007
Springer
16 years 14 days ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...