5889 search results - page 982 / 1178 » Graph Layout Problems |
140
click to vote
INFOCOM
2008
IEEE
16 years 23 days ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
141
click to vote
INFOCOM
2008
IEEE
16 years 23 days ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
153
Voted
INFOCOM
2007
IEEE
16 years 20 days ago
2007
IEEE
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
164
Voted
CIKM
2007
Springer
16 years 16 days ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
176
click to vote
EMMCVPR
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...