Sciweavers

1736 search results - page 113 / 348
» The rank-width of Directed Graphs
Sort
View
PAMI
2006
132views more  PAMI 2006»
15 years 4 months ago
A Generative Sketch Model for Human Hair Analysis and Synthesis
In this paper, we present a generative sketch model for human hair analysis and synthesis. We treat hair images as 2D piecewisely smooth vector (flow) fields, and thus our represe...
Hong Chen, Song Chun Zhu
INFOCOM
2010
IEEE
15 years 2 months ago
Deploying Mesh Nodes under Non-Uniform Propagation
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
15 years 11 months ago
RTG: A Recursive Realistic Graph Generator Using Random Typing
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
Leman Akoglu, Christos Faloutsos
FLAIRS
2006
15 years 5 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
TALG
2008
97views more  TALG 2008»
15 years 4 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon