PCS
2011
13 years 11 months ago
2011
The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary di�...
100
click to vote
PC
2011
13 years 11 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
PAMI
2011
13 years 11 months ago
2011
—This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The ...
NCA
2011
IEEE
13 years 11 months ago
2011
IEEE
—Neural Networks have been an active research area for decades. However, privacy bothers many when the training dataset for the neural networks is distributed between two parties...
MOC
2011
13 years 11 months ago
2011
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
KAIS
2011
13 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...
JVCIR
2011
13 years 11 months ago
2011
A recently developed PLUS factorization holds great promise in image coding due to its simplicity and integer reversibility. However, existing PLUS factorizations did not consider...
JOTA
2011
13 years 11 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
JMLR
2011
13 years 11 months ago
2011
This paper presents the CLUSTERING ALGORITHMS’ REFEREE PACKAGE or CARP, an open source GNU GPL-licensed C package for evaluating clustering algorithms. Calibrating performance o...
JMLR
2011
13 years 11 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...