5055 search results - page 312 / 1011 » Relative Timing |
184
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
173
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
162
click to vote
FLAIRS
1998
15 years 8 months ago
1998
Weintroduce a significant improvementfor a relatively newmachine learning methodcalled Transformation-Based Learning. By applying a MonteCarlo strategy to randomly sample from the...
177
click to vote
DKE
2008
15 years 7 months ago
2008
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...
174
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...