Sciweavers

1554 search results - page 74 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
CGI
2009
IEEE
15 years 6 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang
COMPGEOM
1993
ACM
15 years 7 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
ICASSP
2010
IEEE
15 years 3 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ATAL
2006
Springer
15 years 6 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
JSC
2008
162views more  JSC 2008»
15 years 2 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...