6906 search results - page 299 / 1382 » An algorithm for modelling key terms |
158
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
107
click to vote
DM
2008
15 years 6 months ago
2008
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
198
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in ...
139
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
We propose a new document summarization algorithm which is personalized. The key idea is to rely on the attention (reading) time of individual users spent on single words in a doc...
182
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...