2168 search results - page 70 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
127
Voted
ESANN
2006
15 years 5 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
163
Voted
JGTOOLS
2006
15 years 3 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
135
Voted
DILS
2007
Springer
15 years 9 months ago
2007
Springer
2D-Nuclear magnetic resonance (NMR) spectroscopy is a powerful analytical method to elucidate the chemical structure of molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra cor...
143
Voted
EUROPAR
2007
Springer
15 years 7 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
130
Voted
SMI
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we propose a constrained least squares approach for stably computing Laplacian deformation with strict positional constraints. In the existing work on Laplacian def...