2127 search results - page 337 / 426 » Computing large matchings fast |
120
click to vote
GD
1998
Springer
15 years 8 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
119
click to vote
CSE
2009
IEEE
15 years 7 months ago
2009
IEEE
Many blog posts deal with current issues, so much attention has been paid to identifying topic trends in blogs. This paper suggests a new metric of selecting topic words. We empiri...
153
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
139
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
145
click to vote
PR
2008
15 years 3 months ago
2008
We present a unified feature representation of 2.5D pointclouds and apply it to face recognition. The representation integrates local and global geometrical cues in a single compa...