Sciweavers

54 search results - page 9 / 11
» Negative Information for Motif Discovery
Sort
View
KAIS
2007
75views more  KAIS 2007»
14 years 9 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
WOWMOM
2005
ACM
135views Multimedia» more  WOWMOM 2005»
15 years 3 months ago
Service Discovery in Mobile Ad Hoc Networks: A Field Theoretic Approach
Service discovery in mobile ad hoc networks is challenging because of the absence of any central intelligence in the network. Traditional solutions as used in the Internet are hen...
Vincent Lenders, Martin May, Bernhard Plattner
MOBICOM
2010
ACM
14 years 10 months ago
ZiFi: wireless LAN discovery via ZigBee interference signatures
WiFi networks have enjoyed an unprecedent penetration rate in recent years. However, due to the limited coverage, existing WiFi infrastructure only provides intermittent connectiv...
Ruogu Zhou, Yongping Xiong, Guoliang Xing, Limin S...
BMCBI
2006
108views more  BMCBI 2006»
14 years 9 months ago
Promoter prediction and annotation of microbial genomes based on DNA sequence and structural responses to superhelical stress
Background: In our previous studies, we found that the sites in prokaryotic genomes which are most susceptible to duplex destabilization under the negative superhelical stresses t...
Huiquan Wang, Craig J. Benham
TIT
1998
102views more  TIT 1998»
14 years 9 months ago
On Characterization of Entropy Function via Information Inequalities
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X ) where X = fXi:i 2 g. This can be viewed as a f...
Zhen Zhang, Raymond W. Yeung