Sciweavers

7150 search results - page 1104 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
SIAMSC
2008
131views more  SIAMSC 2008»
15 years 6 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
TIT
2008
72views more  TIT 2008»
15 years 6 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
CAD
2005
Springer
15 years 6 months ago
Surface interpolation of meshes by geometric subdivision
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new nonlinear subdivision schemes, face based subdivi...
Xunnian Yang
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
TCS
2010
15 years 5 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
« Prev « First page 1104 / 1430 Last » Next »