779 search results - page 113 / 156 » A graph polynomial for independent sets of bipartite graphs |
153
click to vote
SIGIR
2006
ACM
16 years 3 days ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
169
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
179
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
186
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
142
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...