7930 search results - page 84 / 1586 » Greedy in Approximation Algorithms |
161
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
165
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
161
click to vote
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
184
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents ma...
147
click to vote
EMNLP
2006
15 years 7 months ago
2006
The end-to-end performance of natural language processing systems for compound tasks, such as question answering and textual entailment, is often hampered by use of a greedy 1-bes...