875 search results - page 96 / 175 » A New Approach for Testing Properties of Discrete Distributi... |
169
click to vote
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
159
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
168
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...
150
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: In a microarray experiment the difference in expression between genes on the same slide is up to 103 fold or more. At low expression, even a small error in the estimat...
153
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...