6575 search results - page 693 / 1315 » Specializing visualization algorithms |
217
click to vote
STACS
1994
Springer
15 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
172
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
147
click to vote
ACCV
2006
Springer
15 years 11 months ago
2006
Springer
We propose a new method for classification of photometric factors, such as diffuse reflection, specular reflection, attached shadow, and cast shadow. For analyzing real images, we ...
187
click to vote
CF
2004
ACM
15 years 11 months ago
2004
ACM
In this paper we present a novel methodology for partial (re-)configuration that can be used for most bitstream configured hardware (HW). In particular low priced and not for part...
190
click to vote
CIVR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. This paper presents novel dissimilarity space specially designed for interactive multimedia retrieval. By providing queries made of positive and negative examples, the go...