Sciweavers

644 search results - page 50 / 129
» A topological characterization of weakness
Sort
View
JUCS
2002
79views more  JUCS 2002»
15 years 6 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka
TIT
2010
98views Education» more  TIT 2010»
15 years 29 days ago
Pairwise intersession network coding on directed networks
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
Chih-Chun Wang, Ness B. Shroff
ICALP
2000
Springer
15 years 10 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera
PAMI
2006
145views more  PAMI 2006»
15 years 6 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 3 months ago
On the Scaling Law for Compressive Sensing and its Applications
1 minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio...
Weiyu Xu, Ao Tang