54 search results - page 9 / 11 » Pattern Matching for Case Analysis: A Computational Definiti... |
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
MM
2006
ACM
14 years 1 months ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
EM
2010
13 years 7 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
JAPLL
2010
13 years 6 months ago
2010
In this paper, several examples from the literature, and one central new one, are used as case studies of texts of discourse containing an argumentation scheme that has now been w...