Sciweavers

7150 search results - page 215 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ICCABS
2011
14 years 10 months ago
Towards accelerating molecular modeling via multi-scale approximation on a GPU
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
Mayank Daga, Wu-chun Feng, Thomas Scogland
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 7 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
JCT
2006
100views more  JCT 2006»
15 years 6 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
16 years 20 days ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
TALG
2010
86views more  TALG 2010»
15 years 4 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez