6393 search results - page 1065 / 1279 » Randomized Algorithms on the Mesh |
170
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
166
click to vote
KAIS
2011
14 years 11 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
123
click to vote
TON
2010
14 years 11 months ago
2010
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on rec...
145
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
136
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
We present a new method for training deformable models. Assume that we have training images where part locations have been labeled. Typically, one fits a model by maximizing the l...