27 search results - page 5 / 6 » Normal forms for general polynomial matrices |
LATIN
2004
Springer
14 years 25 days ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
WG
2005
Springer
14 years 29 days ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
TIT
2008
13 years 7 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
ALGORITHMICA
1999
13 years 7 months ago
1999
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
NIPS
2001
13 years 8 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...