7978 search results - page 114 / 1596 » Combining shared-coin algorithms |
174
Voted
SPIN
2010
Springer
15 years 1 months ago
2010
Springer
In the field of communication networks, protocol engineers usually employ several tools focused on specific kinds of analysis, such as performance or correctness. This paper pres...
154
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
124
click to vote
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
162
Voted
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
207
click to vote
ECCV
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...