1046 search results - page 111 / 210 » Approximation Algorithms for Domination Search |
159
click to vote
RTAS
2011
IEEE
14 years 6 months ago
2011
IEEE
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
128
click to vote
EOR
2008
15 years 3 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
148
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
138
click to vote
SIGIR
2009
ACM
15 years 9 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
130
click to vote
SIGIR
2010
ACM
15 years 3 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...