Sciweavers

1763 search results - page 326 / 353
» Dependent random choice
Sort
View
AI
2008
Springer
13 years 8 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
BMCBI
2008
162views more  BMCBI 2008»
13 years 8 months ago
Improved identification of conserved cassette exons using Bayesian networks
Background: Alternative splicing is a major contributor to the diversity of eukaryotic transcriptomes and proteomes. Currently, large scale detection of alternative splicing using...
Rileen Sinha, Michael Hiller, Rainer Pudimat, Ulri...
CN
2006
60views more  CN 2006»
13 years 7 months ago
Loss strategies for competing AIMD flows
We study in this paper two competing AIMD flows that share a common bottleneck link. When congestion occurs, one (or both) flows will suffer a loss that will cause its throughput ...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T...
KAIS
2008
221views more  KAIS 2008»
13 years 7 months ago
Forecasting skewed biased stochastic ozone days: analyses, solutions and beyond
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently, we have been approached by Texas Commission on En...
Kun Zhang, Wei Fan
TOC
2008
94views more  TOC 2008»
13 years 7 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai