216 search results - page 34 / 44 » Exact Algorithms for L (2, 1)-Labeling of Graphs |
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
ICCAD
1999
IEEE
14 years 1 days ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...