#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1994

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

We present a novel technique for simultaneous seg-mentation and classification of image partitions using graph cuts. By combining existing image segmentation approaches with simple learning techniques we manage to include prior knowledge into this visual grouping process. This has resulted in an method that partitions images into two parts based on… (More)

- Olof Barr, Oskar Wigelius

We show that a polynomial-time rescaling algorithm, in [5], for finding feasible solutions to linear programs, has flaws in its theoretical framework. With new estimates for the algorithm, we show that it indeed terminates in polynomial time. Also, we present a modification of the algorithm, where we suggest a data dependent way of choosing a rescaling… (More)

- Olof Barr
- The Computer Science Journal of Moldova
- 2005

We construct a modied perceptron algorithm that is deter-ministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn 3 log n log(1/ρ)), where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modied perceptron algorithm running… (More)

- Olof Barr
- Discrete Mathematics
- 1994

- ‹
- 1
- ›