3874 search results - page 211 / 775 » Approximation Algorithms for k-hurdle Problems |
155
Voted
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
126
Voted
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
140
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
149
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
132
Voted
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...