Sciweavers

3204 search results - page 160 / 641
» The b-chromatic Number of a Graph
Sort
View
98
Voted
PRL
2007
146views more  PRL 2007»
15 years 8 days ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...
95
Voted
DAC
2008
ACM
16 years 1 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
97
Voted
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
15 years 7 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
102
Voted
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
15 years 6 months ago
Histogram Matching for Camera Pose Neighbor Selection
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
Kevin L. Steele, Parris K. Egbert, Bryan S. Morse
105
Voted
COCOON
2005
Springer
15 years 6 months ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...