1159 search results - page 55 / 232 » Binary Decision Graphs |
112
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
Cooperative communications is a rapidly evolving research area. Most of the cooperative protocols that have appeared in the literature assume slow flat fading channels and Gaussi...
142
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
145
click to vote
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
118
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
119
click to vote
SIROCCO
2008
15 years 4 months ago
2008
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...