430 search results - page 52 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
SIAMMAX
2010
13 years 2 months ago
2010
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
APSEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
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...
PODS
2010
ACM
14 years 29 days ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...