4865 search results - page 553 / 973 » The Complexity of Graph Connectivity |
196
click to vote
CPM
2005
Springer
16 years 12 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 12 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...
171
click to vote
PACT
2005
Springer
16 years 11 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...
202
click to vote
WAC
2005
Springer
16 years 10 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...
171
click to vote
DMSN
2004
ACM
16 years 9 days ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...