Sciweavers

4315 search results - page 170 / 863
» Sorting in linear time
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
IOR
2010
98views more  IOR 2010»
13 years 6 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
SIAMNUM
2010
115views more  SIAMNUM 2010»
13 years 3 months ago
Superconvergence of Discontinuous Galerkin and Local Discontinuous Galerkin Schemes for Linear Hyperbolic and Convection-Diffusi
In this paper, we study the superconvergence property for the discontinuous Galerkin (DG) and the local discontinuous Galerkin (LDG) methods, for solving one-dimensional time depe...
Yingda Cheng, Chi-Wang Shu
ICCV
2011
IEEE
12 years 11 months ago
Fast Template Matching in Non-Linear Tone-Mapped Images
We propose a fast pattern matching scheme termed Matching by Tone Mapping (MTM) which allows matching under non-linear tone mappings. We show that, when tone mapping is approximate...
Yacov Hel-Or, Hagit Hel-Or and Eyal David
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
11 years 11 months ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young