Sciweavers

1532 search results - page 11 / 307
» Connection Relations in Mereotopology
Sort
View
ICDM
2010
IEEE
158views Data Mining» more  ICDM 2010»
13 years 5 months ago
Patterns on the Connected Components of Terabyte-Scale Graphs
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...
U. Kang, Mary McGlohon, Leman Akoglu, Christos Fal...
RELMICS
1998
Springer
13 years 11 months ago
Coping with semilattices of relations in logics with relative accessibility relations
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
Stéphane Demri
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
PE
2002
Springer
137views Optimization» more  PE 2002»
13 years 7 months ago
Analysis of two competing TCP/IP connections
Many mathematical models exist for describing the behavior of TCP/IP (TCP: transmission control protocol) under an exogenous loss process that does not depend on the window size. ...
Eitan Altman, Tania Jiménez, R. Nú&n...
JCSS
2010
146views more  JCSS 2010»
13 years 5 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...