75 search results - page 11 / 15 » Improved Algorithm for Degree Bounded Survivable Network Des... |
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— It was shown by Cadambe and Jafar that the interference alignment (IA) algorithm achieves the theoretical bound on degrees of freedom (DOF) for interference channel systems. Ho...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...