5864 search results - page 99 / 1173 » Can We Work around Numerical Methods |
127
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We investigate in this paper the anchor selection problem with consideration of anchor location uncertainty, which arises naturally from error propagation problem in successive or...
142
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
128
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
128
click to vote
GI
2009
Springer
15 years 1 months ago
2009
Springer
Abstract: In biomolecular simulations intensive computations are spent in nonbonded interactions kernels, i.e., electrostatic interactions. Therefore this part can be considered as...
102
click to vote
RT
1995
Springer
15 years 7 months ago
1995
Springer
This paper explores numerical techniques for comparing real and synthetic luminance images. We introduce components of a perceptually based metric using ideas from the image compre...