1629 search results - page 57 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
137
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
162
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
181
click to vote
SLIP
2004
ACM
15 years 11 months ago
2004
ACM
Interconnect power is dynamic power dissipation due to switching of interconnection capacitances. This paper describes the characterization of interconnect power in a state-of-the...
190
click to vote
ENDM
2008
15 years 6 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
193
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...