4110 search results - page 532 / 822 » Efficient algorithms for the 2-gathering problem |
199
click to vote
ACL
2010
15 years 4 months ago
2010
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
250
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
193
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
187
click to vote
SASO
2010
IEEE
15 years 4 months ago
2010
IEEE
To keep pace with constantly changing markets, many companies are seeking strategic partnerships. In this paper, we assume that a company can electronically provide a profile of th...
209
click to vote
EMNLP
2009
15 years 4 months ago
2009
In this paper we address the problem of identifying a broad range of term variations in Japanese web search queries, where these variations pose a particularly thorny problem due ...