Sciweavers

5066 search results - page 824 / 1014
» Spectra of structures and relations
Sort
View
DAM
1999
128views more  DAM 1999»
15 years 3 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
LOGCOM
2002
142views more  LOGCOM 2002»
15 years 3 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke
MT
2002
118views more  MT 2002»
15 years 3 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...
MST
1998
76views more  MST 1998»
15 years 3 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
PR
2002
81views more  PR 2002»
15 years 3 months ago
Generalised correlation for multi-feature correspondence
Computing correspondences between pairs of images is fundamental to all structures from motion algorithms. Correlation is a popular method to estimate similarity between patches o...
C. V. Jawahar, P. J. Narayanan