5100 search results - page 77 / 1020 » The Linear Complexity of a Graph |
FLOPS
2010
Springer
14 years 2 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
ISPDC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...