796 search results - page 89 / 160 » Approximating the centroid is hard |
IPCCC
2006
IEEE
14 years 1 months ago
2006
IEEE
Recent work on distributed RAM sharing has largely focused on leveraging low-latency networking technologies to optimize remote memory access. In contrast, we revisit the idea of ...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
FSTTCS
2003
Springer
14 years 28 days ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
DATE
2010
IEEE
14 years 24 days ago
2010
IEEE
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...