4926 search results - page 220 / 986 » Two Graph Algorithms On an Associative Computing Model |
145
click to vote
IWPEC
2009
Springer
16 years 27 days ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
149
Voted
JMLR
2010
15 years 1 months ago
2010
Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
116
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
This paper presents a method for rectifying video sequences from rolling shutter (RS) cameras. In contrast to previous RS rectification attempts we model distortions as being cau...
172
click to vote
CPC
2006
15 years 6 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
162
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoret...