1538 search results - page 214 / 308 » Spectral Techniques in Graph Algorithms |
132
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
116
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
100
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
A new algorithm is proposed for novel view generation in one-toone teleconferencing applications. Given the video streams acquired by two cameras placed on either side of a comput...
144
click to vote
PAMI
2006
15 years 1 months ago
2006
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
113
click to vote
VTC
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract—It is widely recognized that differential decode-andforward (DDF) cooperative transmission scheme is capable of providing a superior performance compared to classic dire...