10890 search results - page 2071 / 2178 » Automatic Complexity Analysis |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...