Sciweavers

1243 search results - page 118 / 249
» On the locality of bounded growth
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
AHSWN
2010
102views more  AHSWN 2010»
15 years 6 months ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 6 months ago
On Pure and (approximate) Strong Equilibria of Facility Location Games
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
Thomas Dueholm Hansen, Orestis Telelis
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
MICCAI
2009
Springer
16 years 7 months ago
Tumor Invasion Margin on the Riemannian Space of Brain Fibers
Gliomas are one of the most challenging tumors to treat or control locally. One of the main challenges is determining which areas of the apparently normal brain contain glioma cell...
Dana Cobzas, Parisa Mosayebi, Albert Murtha, Marti...