7930 search results - page 308 / 1586 » Greedy in Approximation Algorithms |
129
click to vote
ISSAC
2005
Springer
16 years 4 days ago
2005
Springer
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
164
click to vote
INFOCOM
2007
IEEE
16 years 28 days ago
2007
IEEE
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
156
click to vote
ADC
2006
Springer
16 years 19 days ago
2006
Springer
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
184
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
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...
169
click to vote
EOR
2008
15 years 6 months ago
2008
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...