815 search results - page 116 / 163 » Approximate Entropy Reducts |
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
121
click to vote
KDD
2004
ACM
15 years 5 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
107
click to vote
SI3D
1997
ACM
15 years 4 months ago
1997
ACM
This paper presents a practical technique to automatically compute approximations of polygonal representations of 3D objects. It is based on a previously developed model simplific...
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...