5100 search results - page 175 / 1020 » The Linear Complexity of a Graph |
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
NIPS
2003
14 years 15 hour ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
BPM
2008
Springer
14 years 20 days ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
PQCRYPTO
2010
14 years 2 months ago
2010
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
ACTA
2002
13 years 10 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...