Sciweavers

3008 search results - page 518 / 602
» Independence in connected graphs
Sort
View
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
16 years 13 days ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
FOCS
2006
IEEE
16 years 12 days ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
ICDM
2006
IEEE
109views Data Mining» more  ICDM 2006»
16 years 12 days ago
Star-Structured High-Order Heterogeneous Data Co-clustering Based on Consistent Information Theory
Heterogeneous object co-clustering has become an important research topic in data mining. In early years of this research, people mainly worked on two types of heterogeneous data ...
Bin Gao, Tie-Yan Liu, Wei-Ying Ma
ICRA
2006
IEEE
104views Robotics» more  ICRA 2006»
16 years 12 days ago
Graphical Singularity Analysis of Planar Parallel Manipulators
- This paper introduces a new approach to identify singularities of planar parallel manipulators (PPMs). This method is based on Maxwell’s reciprocal figure theory which establis...
Amir Degani, Alon Wolf
INFOCOM
2006
IEEE
16 years 11 days ago
To Peer or Not to Peer: Modeling the Evolution of the Internet's AS-Level Topology
— Internet connectivity at the AS level, defined in terms of pairwise logical peering relationships, is constantly evolving. This evolution is largely a response to economic, po...
Hyunseok Chang, Sugih Jamin, Walter Willinger