Sciweavers

7015 search results - page 195 / 1403
» Approximation algorithms for co-clustering
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 7 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
EOR
2008
93views more  EOR 2008»
15 years 6 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
TIP
2008
113views more  TIP 2008»
15 years 6 months ago
Phase Local Approximation (PhaseLa) Technique for Phase Unwrap From Noisy Data
The local polynomial approximation (LPA) is a nonparametric regression technique with pointwise estimation in a sliding window. We apply the LPA of the argument of cos and sin in o...
Vladimir Katkovnik, Jaakko Astola, Karen O. Egiaza...
ECRTS
2009
IEEE
15 years 4 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
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