Sciweavers

630 search results - page 83 / 126
» Hardness results for approximating the bandwidth
Sort
View
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
TON
2008
99views more  TON 2008»
15 years 6 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
BC
2002
90views more  BC 2002»
15 years 6 months ago
Converging evidence for a simplified biophysical model of synaptic plasticity
Different mechanisms that could form the molecular basis for bi-directional synaptic plasticity have been identified experimentally and corresponding biophysical models can be cons...
Harel Z. Shouval, Gastone C. Castellani, Brian S. ...
CVPR
2007
IEEE
16 years 8 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
RECOMB
2007
Springer
16 years 6 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss