Sciweavers

8228 search results - page 1471 / 1646
» Structural Logical Relations
Sort
View
112
Voted
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
15 years 2 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
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...
Anna Galluccio, Martin Loebl
127
Voted
JECR
2002
133views more  JECR 2002»
15 years 2 months ago
From Design Features to Financial Performance: A Comprehensive Model of Design Principles for Online Stock Trading Sites
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, ...
YoungSu Lee, Jinwoo Kim
155
Voted
DAM
1999
128views more  DAM 1999»
15 years 2 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
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...
Serafino Cicerone, Gabriele Di Stefano
118
Voted
MT
2002
118views more  MT 2002»
15 years 2 months ago
Principles of Context-Based Machine Translation Evaluation
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...
Eduard H. Hovy, Margaret King, Andrei Popescu-Beli...
112
Voted
MST
1998
76views more  MST 1998»
15 years 2 months ago
Sharply Bounded Alternation and Quasilinear Time
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 ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
« Prev « First page 1471 / 1646 Last » Next »