3471 search results - page 338 / 695 » Obstacle Numbers of Graphs |
156
click to vote
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we present an automatic human portrait system based on the And-Or graph representation. The system can automatically generate a set of life-like portraits ...
193
click to vote
TKDE
2008
15 years 6 months ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
200
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
158
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
232
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...