Sciweavers

205 search results - page 16 / 41
» Engineering Planar Separator Algorithms
Sort
View
149
Voted
SIAMIS
2011
14 years 4 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
CEC
2003
IEEE
15 years 2 months ago
An evolutionary approach to microstructure optimisation of stereolithographic models
The aim of this work is to utilize an evolutationary algorithm to evolve the microstructure of an object created by a stereolithography machine. This should be optimised to be able...
Siavash Haroun Mahdavi, Sean Hanna
VIS
2004
IEEE
146views Visualization» more  VIS 2004»
15 years 10 months ago
Tracking of Vector Field Singularities in Unstructured 3D Time-Dependent Datasets
In this paper, we present an approach for monitoring the positions of vector field singularities in time-dependent datasets. The concept of singularity index is discussed and exte...
Christoph Garth, Xavier Tricoche, Gerik Scheuerman...
92
Voted
CISS
2007
IEEE
14 years 11 months ago
Quantum Switching Networks with Classical Routing
— Flexible distribution of data in the form of quantum bits (qubits) amongst spatially separated entities is an essential component of envisioned scalable quantum computing archi...
Rahul Ratan, Manish Kumar Shukla, A. Yavuz Oru&cce...
FSTTCS
2001
Springer
15 years 1 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren