2018 search results - page 180 / 404 » Magnitude-preserving ranking algorithms |
173
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
182
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
178
click to vote
AI
2008
Springer
16 years 24 days ago
2008
Springer
Abstract. Conventional web search engines retrieve too many documents for the majority of the submitted queries; therefore, they possess a good recall, since there are far more pag...
189
click to vote
IROS
2007
IEEE
16 years 22 days ago
2007
IEEE
— In this paper, we present an Extended Kalman Filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the n...
155
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...