Sciweavers

6110 search results - page 112 / 1222
» Approximate Computing
Sort
View
DEXAW
2007
IEEE
135views Database» more  DEXAW 2007»
16 years 21 days ago
Unsupervised Learning of Manifolds via Linear Approximations
In this paper, we examine the application of manifold learning to the clustering problem. The method used is Locality Preserving Projections (LPP), which is chosen because of its ...
Hassan A. Kingravi, M. Emre Celebi, Pragya P. Raja...
PPSN
2004
Springer
15 years 11 months ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson
STACS
2010
Springer
15 years 11 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
Neelesh Khanna, Surender Baswana
SCALESPACE
1999
Springer
15 years 10 months ago
A Geometric Functional for Derivatives Approximation
We develop on estimation method, for the derivative field of an image based on Bayesian approach which is formulated in a geometric way. The Maximum probability configuration of ...
Nir A. Sochen, Robert M. Haralick, Yehoshua Y. Zee...
ESANN
2003
15 years 7 months ago
Fast approximation of the bootstrap for model selection
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
Geoffroy Simon, Amaury Lendasse, Vincent Wertz, Mi...