Sciweavers

2031 search results - page 300 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
SIGCOMM
2010
ACM
14 years 10 months ago
NeuroPhone: brain-mobile phone interface using a wireless EEG headset
Neural signals are everywhere just like mobile phones. We propose to use neural signals to control mobile phones for hands-free, silent and effortless human-mobile interaction. Un...
Andrew T. Campbell, Tanzeem Choudhury, Shaohan Hu,...
BMCBI
2010
123views more  BMCBI 2010»
14 years 10 months ago
eGIFT: Mining Gene Information from the Literature
Background: With the biomedical literature continually expanding, searching PubMed for information about specific genes becomes increasingly difficult. Not only can thousands of r...
Catalina O. Tudor, Carl J. Schmidt, K. Vijay-Shank...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
15 years 10 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
KDD
2007
ACM
176views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining correlated bursty topic patterns from coordinated text streams
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
Xuanhui Wang, ChengXiang Zhai, Xiao Hu, Richard Sp...