Sciweavers

5606 search results - page 290 / 1122
» Randomization Techniques for Graphs.
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
15 years 5 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
VTC
2008
IEEE
156views Communications» more  VTC 2008»
16 years 27 days ago
Channel Asymmetry and Random Time Slot Hopping in OFDMA-TDD Cellular Networks
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
Ellina Foutekova, Patrick Agyapong, Harald Haas
SAC
2003
ACM
15 years 11 months ago
A Markov Random Field Model of Microarray Gridding
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
Mathias Katzer, Franz Kummert, Gerhard Sagerer
BCS
2008
15 years 8 months ago
Adaptive Random Re-Routing for Differentiated QoS in Sensor Networks
Much of the traffic carried by Sensor Networks will originate from routine measurements or observations by sensors which monitor a particular situation, such as the temperature an...
Erol Gelenbe, Edith C. H. Ngai
INFOCOM
1997
IEEE
15 years 10 months ago
Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
Stavros D. Nikolopoulos, Andreas Pitsillides, Davi...