Sciweavers

67 search results - page 13 / 14
» Complexity Results on Graphs with Few Cliques
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
FASE
2008
Springer
13 years 9 months ago
A Formal Framework for Developing Adaptable Service-Based Applications
Web services are open, interoperable, easy to integrate and reuse, and are extensively used in many application domains. Research and best practices have produced excellent support...
Leen Lambers, Leonardo Mariani, Hartmut Ehrig, Mau...
BMCBI
2005
95views more  BMCBI 2005»
13 years 7 months ago
Oligomeric protein structure networks: insights into protein-protein interactions
Background: Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the princip...
K. V. Brinda, Saraswathi Vishveshwara
IJCAI
1989
13 years 8 months ago
Reasoning about Kinematic Topology
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
Boi Faltings, Emmanuel Baechler, J. Primus
BIBM
2010
IEEE
286views Bioinformatics» more  BIBM 2010»
13 years 5 months ago
Evaluation of short read metagenomic assembly
Advances in sequencing technologies have equipped researchers with the ability to sequence the collective genome of entire microbial communities commonly referred to as metagenomi...
Anveshi Charuvaka, Huzefa Rangwala