552 search results - page 46 / 111 » Observable Graphs |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
EUROISI
2008
13 years 9 months ago
2008
Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...
ACCV
2010
Springer
13 years 3 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...