Sciweavers

347 search results - page 45 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
IPPS
2009
IEEE
15 years 6 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
102
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 11 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
15 years 6 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
ISMB
1993
15 years 1 months ago
Pattern Discovery in Gene Regulation: Designing an Analysis Environment
Interactions that determinecellular fate are exceedingly complex, can take place at different levels of gene regulation and involve a large numberof components(such as genes, prot...
Stella Veretnik, Bruce R. Schatz
BMCBI
2008
214views more  BMCBI 2008»
14 years 10 months ago
Enhanced Bayesian modelling in BAPS software for learning genetic structures of populations
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
Jukka Corander, Pekka Marttinen, Jukka Siré...