Sciweavers

114 search results - page 9 / 23
» The Covert Set-Cover Problem with Application to Network Dis...
Sort
View
BMCBI
2006
113views more  BMCBI 2006»
13 years 7 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
BROADNETS
2006
IEEE
13 years 9 months ago
On the Broadcast Storm Problem in Ad hoc Wireless Networks
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
Ozan K. Tonguz, Nawaporn Wisitpongphan, Jayendra S...
CIKM
2009
Springer
14 years 1 months ago
Potential collaboration discovery using document clustering and community structure detection
Complex network analysis is a growing research area in a wide variety of domains and has recently become closely associated with data, text and web mining. One of the most active ...
Cristian Klen dos Santos, Alexandre Evsukoff, Beat...
CN
2010
149views more  CN 2010»
13 years 7 months ago
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
In the current Internet picture more than 70% of the hosts are located behind Network Address Translators (NATs). This is not a problem in the client/server paradigm. However, the...
Rubén Cuevas Rumín, Ángel Cue...
PAKDD
2010
ACM
173views Data Mining» more  PAKDD 2010»
13 years 5 months ago
Distributed Knowledge Discovery with Non Linear Dimensionality Reduction
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
Panagis Magdalinos, Michalis Vazirgiannis, Dialect...