1952 search results - page 200 / 391 » Complete partitions of graphs |
189
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
166
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Model learning and tracking are two important topics in computer vision. While there are many applications where one of them is used to support the other, there are currently only...
151
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
165
click to vote
MOR
2010
15 years 5 months ago
2010
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
187
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...