3875 search results - page 655 / 775 » Approximation Algorithms for the Max-coloring Problem |
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
BIOCOMP
2008
13 years 10 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
BMCBI
2008
13 years 9 months ago
2008
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
IJRR
2007
13 years 9 months ago
2007
Recent research concerning the Gaussian canonical form for Simultaneous Localization and Mapping (SLAM) has given rise to a handful of algorithms that attempt to solve the SLAM sc...