Sciweavers

3068 search results - page 240 / 614
» Clustering with Multiple Graphs
Sort
View
BMCBI
2008
143views more  BMCBI 2008»
15 years 5 months ago
Gene identification and protein classification in microbial metagenomic sequence data via incremental clustering
Background: The identification and study of proteins from metagenomic datasets can shed light on the roles and interactions of the source organisms in their communities. However, ...
Shibu Yooseph, Weizhong Li, Granger G. Sutton
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
16 years 2 days ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
JGT
2007
68views more  JGT 2007»
15 years 5 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein
CGF
2000
97views more  CGF 2000»
15 years 5 months ago
Collaboration between Heterogeneous Stand-alone 3-D Graphical Applications
We describe the Scene-Graph-As-Bus technique (SGAB), the first step in a staircase of solutions for sharing software components for virtual environments. The goals of SGAB are to ...
Robert C. Zeleznik, Loring Holden, Michael V. Capp...
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
15 years 3 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu