1729 search results - page 285 / 346 » On Bounds for the k-Partitioning of Graphs |
146
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
163
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
156
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
147
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
183
click to vote
CODES
2006
IEEE
15 years 8 months ago
2006
IEEE
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...