Sciweavers

16430 search results - page 113 / 3286
» On Computable Tree Functions
Sort
View
137
Voted
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 10 months ago
Multiparty Equality Function Computation in Networks with Point-to-Point Links
Abstract. In this paper, we study the problem of computing the multiparty equality (MEQ) function: n 2 nodes, each of which is given an input value from {1,
Guanfeng Liang, Nitin H. Vaidya
104
Voted
JSYML
2010
71views more  JSYML 2010»
15 years 1 months ago
Limitwise monotonic functions, sets, and degrees on computable domains
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
Asher M. Kach, Daniel Turetsky
133
Voted
GECCO
2000
Springer
123views Optimization» more  GECCO 2000»
15 years 7 months ago
Genomic computing: explanatory modelling for functional genomics
Many newly discovered genes are of unknown function. DNA microarrays are a method for determining the expression levels of all genes in an organism for which a complete genome seq...
Richard J. Gilbert, Jem J. Rowland, Douglas B. Kel...
131
Voted
USENIX
2000
15 years 4 months ago
Dynamic Function Placement for Data-Intensive Cluster Computing
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
Khalil Amiri, David Petrou, Gregory R. Ganger, Gar...
ISSAC
2004
Springer
94views Mathematics» more  ISSAC 2004»
15 years 8 months ago
Algorithms for polynomial GCD computation over algebraic function fields
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
Mark van Hoeij, Michael B. Monagan