1933 search results - page 160 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
136
click to vote
IPM
2008
15 years 4 months ago
2008
This article explores how to develop complex data driven user models that go beyond the bag of words model and topical relevance. We propose to learn from rich user specific info...
184
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
165
Voted
PROPERTYTESTING
2010
15 years 2 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
114
click to vote
BIOCOMP
2006
15 years 5 months ago
2006
In the past decades, many clustering algorithms have been proposed for the analysis of gene expression data, but little guidance is available to help choose among them. Given the ...
148
Voted
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...