416 search results - page 5 / 84 » Simple and Efficient Algorithm for Approximate Dictionary Ma... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
ESANN
2006
13 years 9 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
AAAI
2010
13 years 9 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
ENTCS
2008
13 years 7 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
TVLSI
2010
13 years 2 months ago
2010
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...