2489 search results - page 144 / 498 » On the Subgroup Distance Problem |
138
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
128
click to vote
PR
2002
15 years 3 months ago
2002
7 Major problems exist in both crisp and fuzzy clustering algorithms. The fuzzy c-means type of algorithms use weights determined by a power m of inverse distances that remains
169
click to vote
BCB
2010
14 years 11 months ago
2010
As a metabolic network reaches from a state to a steady state, a subset of its fluxes gradually change. The sequence of intermediate states, called the dynamic state, shows the pa...
144
Voted
ALGOSENSORS
2004
Springer
15 years 9 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
140
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we define a mobile self-localization (MSL) problem for sparse mobile sensor networks, and propose an algorithm named Mobility Assisted MDS-MAP(P), based on Mult...