8228 search results - page 1471 / 1646 » Structural Logical Relations |
COMBINATORICS
1999
13 years 10 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
JECR
2002
13 years 10 months ago
2002
As e-business grows rapidly, interests in design principles for e-business web sites are increasing. A few studies have suggested design principles with concrete design features, ...
DAM
1999
13 years 10 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
MT
2002
13 years 10 months ago
2002
This article defines a Framework for Machine Translation Evaluation (FEMTI) which relates the quality model used to evaluate a machine translation system to the purpose and context...
MST
1998
13 years 10 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...