Sciweavers

1117 search results - page 3 / 224
» Equivalent Representations of Set Functions
Sort
View
JELIA
2004
Springer
14 years 22 days ago
Logic Programs with Functions and Default Values
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
Pedro Cabalar, David Lorenzo
NIPS
1998
13 years 8 months ago
Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
Michael S. Lewicki, Terrence J. Sejnowski
FFA
2011
104views more  FFA 2011»
13 years 2 months ago
Zeta functions of equivalence relations over finite fields
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
Tibor Beke
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
13 years 11 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
BMCBI
2008
144views more  BMCBI 2008»
13 years 7 months ago
Automatically extracting functionally equivalent proteins from SwissProt
Background: There is a frequent need to obtain sets of functionally equivalent homologous proteins (FEPs) from different species. While it is usually the case that orthology impli...
Lisa E. M. McMillan, Andrew C. R. Martin