2194 search results - page 1 / 439 » Improving HLRTA*( k ) |
62
Voted
CAEPIA
2007
Springer
15 years 5 months ago
2007
Springer
117
Voted
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
107
Voted
CATS
1998
15 years 7 days ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
101
Voted
CIKM
2011
Springer
13 years 10 months ago
2011
Springer
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
91
Voted
DMIN
2009
14 years 8 months ago
2009
- Over the last twenty years, text classification has become one of the key techniques for organizing electronic information such as text and web documents. The k-Nearest Neighbor ...