370 search results - page 70 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
69
Voted
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
75
Voted
COR
2010
14 years 9 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
116
click to vote
TSMC
2010
14 years 4 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...