3008 search results - page 425 / 602 » Independence in connected graphs |
199
click to vote
CPM
2005
Springer
16 years 15 days ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
179
click to vote
GCC
2005
Springer
16 years 15 days ago
2005
Springer
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefit...
185
Voted
IPSN
2005
Springer
16 years 14 days ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
173
click to vote
PACT
2005
Springer
16 years 14 days ago
2005
Springer
We describe a fragment of the hardware description language VHDL that is suitable for implementing the Advanced Encryption Standard algorithm. We then define an Information Flow a...
205
click to vote
WAC
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. In this paper we describe ConStruct, a distributed, contextaggregation based service infrastructure which supports the development of context-aware applications. ConStruc...