51 search results - page 10 / 11 » On the density of a graph and its blowup |
107
click to vote
AMDO
2010
Springer
14 years 7 months ago
2010
Springer
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
GRAPHICSINTERFACE
2008
14 years 11 months ago
2008
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
BMCBI
2010
14 years 9 months ago
2010
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...