46 search results - page 2 / 10 » The cost of getting local monotonicity |
ICDM
2003
IEEE
13 years 11 months ago
2003
IEEE
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
WEA
2005
Springer
13 years 11 months ago
2005
Springer
We point out that for two sets of measurements, the sign of the difference of their averages is not necessarily maintained by a non-linear monotone transformation of the individu...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
CRV
2005
IEEE
13 years 7 months ago
2005
IEEE
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
GLOBECOM
2008
IEEE
14 years 6 days ago
2008
IEEE
—We present a novel cost-effective multicast capable optical cross connect (MC-OXC) node architecture which improves efficiency of optical power by constraining splitting to only...