5889 search results - page 178 / 1178 » Graph Layout Problems |
152
click to vote
DM
2002
15 years 6 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
161
click to vote
ICDCS
2008
IEEE
16 years 24 days ago
2008
IEEE
Mobile sensors can move and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes mostly over-simplify the conditions for network con...
159
click to vote
INFOCOM
2008
IEEE
16 years 23 days ago
2008
IEEE
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
169
Voted
MM
2006
ACM
16 years 9 days ago
2006
ACM
Navigation through large multimedia collections that include videos and images still remains a hard problem. In this paper, we introduce a novel method to visualize and navigate t...
147
click to vote
DAC
2000
ACM
15 years 10 months ago
2000
ACM
—Chemical–mechanical polishing (CMP) is an enabling technique used in deep-submicrometer VLSI manufacturing to achieve long range oxide planarization. Post-CMP oxide topography...