Sciweavers

76 search results - page 9 / 16
» Finding a Large Hidden Clique in a Random Graph
Sort
View
TMC
2011
201views more  TMC 2011»
13 years 2 months ago
Data Delivery Properties of Human Contact Networks
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
Nishanth Sastry, D. Manjunath, Karen R. Sollins, J...
KDD
2007
ACM
143views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining Research Communities in Bibliographical Data
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...
Osmar R. Zaïane, Jiyang Chen, Randy Goebel
BMCBI
2006
144views more  BMCBI 2006»
13 years 7 months ago
Development and implementation of an algorithm for detection of protein complexes in large interaction networks
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
Md. Altaf-Ul-Amin, Yoko Shinbo, Kenji Mihara, Ken ...
IPPS
2005
IEEE
14 years 1 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
IROS
2007
IEEE
148views Robotics» more  IROS 2007»
14 years 1 months ago
Tractable probabilistic models for intention recognition based on expert knowledge
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
Oliver C. Schrempf, David Albrecht, Uwe D. Hanebec...