Sciweavers

1399 search results - page 92 / 280
» New Algorithms for k-Center and Extensions
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 9 months ago
Factoring Polynomials over Finite Fields using Balance Test
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
Chandan Saha
AVSS
2009
IEEE
13 years 7 months ago
3D Face Recognition Using Multiview Keypoint Matching
A novel algorithm for 3D face recognition based point cloud rotations, multiple projections, and voted keypoint matching is proposed and evaluated. The basic idea is to rotate eac...
Michael Mayo, Edmond Zhang
ICDM
2009
IEEE
138views Data Mining» more  ICDM 2009»
13 years 6 months ago
Accurate Discovery of Valid Convoys from Moving Object Trajectories
Given a set of moving object trajectories, it is of interest to find a group of objects, called a convoy, that are spatially density-connected for a certain duration of time. Howev...
Hyunjin Yoon, Cyrus Shahabi
JMLR
2010
106views more  JMLR 2010»
13 years 3 months ago
Why Does Unsupervised Pre-training Help Deep Learning?
Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of auto-encoder variants, with impressive results obtai...
Dumitru Erhan, Yoshua Bengio, Aaron C. Courville, ...
CVPR
2011
IEEE
13 years 25 days ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...