925 search results - page 102 / 185 » Connectivity on Complete Lattices |
175
click to vote
TCS
2010
15 years 4 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
140
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
149
click to vote
ICDM
2009
IEEE
15 years 3 months ago
2009
IEEE
Given a set of moving object trajectories, it is of interest to find a group of objects, called a convoy, that are spatially density-connected for a certain duration of time. Howev...
172
click to vote
ICUMT
2009
15 years 3 months ago
2009
This paper investigates topology management of large wireless sensor networks. Due to their random deployment, nodes have to organize themselves as energy efficient as possible to ...
190
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...