2194 search results - page 18 / 439 » Improving HLRTA*( k ) |
100
click to vote
FCT
2007
Springer
15 years 7 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
91
Voted
ICANN
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a method that combines Mutual Information and k-Nearest Neighbors approximator for time series prediction. Mutual Information is used for input selection. K-Nea...
107
Voted
WALCOM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
137
Voted
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Keystroke dynamics exhibit people’s behavioral features which are similar to hand signatures. A major problem hindering the large scale deployment of this technology is its h...
88
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...