453 search results - page 53 / 91 » Tight bounds for the partial-sums problem |
CORR
2008
Springer
15 years 23 days ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
112
click to vote
JGAA
2006
15 years 19 days ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
127
Voted
SIAMJO
2008
15 years 18 days ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
141
Voted
JMLR
2010
14 years 7 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
107
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...