1538 search results - page 35 / 308 » Relative Randomness and Cardinality |
69
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
108
Voted
MOR
2000
14 years 9 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
ICPADS
2007
IEEE
15 years 4 months ago
2007
IEEE
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...