Sciweavers

817 search results - page 17 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
MVA
2010
130views Computer Vision» more  MVA 2010»
13 years 7 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh
ICMLA
2007
13 years 10 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
VLDB
1998
ACM
97views Database» more  VLDB 1998»
14 years 24 days ago
Design and Analysis of Parametric Query Optimization Algorithms
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such asselectivity and resourceavailability. The execution of...
Sumit Ganguly
CVPR
2011
IEEE
13 years 6 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
JACM
2010
111views more  JACM 2010»
13 years 7 months ago
Finding a maximum matching in a sparse random graph in O(n) expected time
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
Prasad Chebolu, Alan M. Frieze, Páll Melste...