3008 search results - page 274 / 602 » Independence in connected graphs |
182
click to vote
ISPA
2007
Springer
16 years 25 days ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
201
Voted
PDP
2005
IEEE
16 years 8 days ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
215
click to vote
SPIRE
2005
Springer
16 years 5 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
168
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
168
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...