Sciweavers

16430 search results - page 744 / 3286
» On Computable Tree Functions
Sort
View
EJC
2011
15 years 2 months ago
Enumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Brendon Rhoades
LOPSTR
2005
Springer
16 years 29 days ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus
BMCBI
2008
117views more  BMCBI 2008»
15 years 7 months ago
A probabilistic framework to predict protein function from interaction data integrated with semantic knowledge
Background: The functional characterization of newly discovered proteins has been a challenge in the post-genomic era. Protein-protein interactions provide insights into the funct...
Young-Rae Cho, Lei Shi, Murali Ramanathan, Aidong ...
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
16 years 4 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
COLT
2008
Springer
15 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim