175 search results - page 26 / 35 » max-cut and Containment Relations in Graphs |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
We propose a method for simultaneous detection, localization and segmentation of objects of a known category. We show that this is possible by using segments as features. To this ...
GLVLSI
2007
IEEE
14 years 3 months ago
2007
IEEE
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
BVAI
2007
Springer
14 years 2 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
IDA
2010
Springer
13 years 7 months ago
2010
Springer
According to Koestler, the notion of a bisociation denotes a connection between pieces of information from habitually separated domains or categories. In this paper, we consider a ...