Sciweavers

1282 search results - page 167 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
MOBICOM
2006
ACM
15 years 10 months ago
Boundary recognition in sensor networks by topological methods
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
Yue Wang, Jie Gao, Joseph S. B. Mitchell
WABI
2007
Springer
102views Bioinformatics» more  WABI 2007»
15 years 10 months ago
Homology Search with Fragmented Nucleic Acid Sequence Patterns
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
Axel Mosig, Julian J.-L. Chen, Peter F. Stadler
175
Voted
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 11 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
INFOCOM
2011
IEEE
14 years 8 months ago
Taming user-generated content in mobile networks via Drop Zones
Abstract—Smartphones have changed the way people communicate. Most prominently, using commonplace mobile device features (e.g., high resolution cameras), they started producing a...
Ionut Trestian, Supranamaya Ranjan, Aleksandar Kuz...
WSNA
2003
ACM
15 years 9 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li