8810 search results - page 1353 / 1762 » Open. Closed. Open |
170
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can ...
159
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
168
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
182
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
168
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...