Sciweavers

895 search results - page 35 / 179
» Using graphs for some discrete tomography problems
Sort
View
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 5 months ago
Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
Jie Shen, Haijun Yu
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 8 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
GD
2009
Springer
13 years 8 months ago
On Open Problems in Biological Network Visualization
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
Mario Albrecht, Andreas Kerren, Karsten Klein, Oli...
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 2 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
JMLR
2008
139views more  JMLR 2008»
13 years 11 months ago
Regularization on Graphs with Function-adapted Diffusion Processes
Harmonic analysis and diffusion on discrete data has been shown to lead to state-of-theart algorithms for machine learning tasks, especially in the context of semi-supervised and ...
Arthur D. Szlam, Mauro Maggioni, Ronald R. Coifman