Sciweavers

2638 search results - page 438 / 528
» Random Geometric Complexes
Sort
View
ASUNAM
2009
IEEE
16 years 28 days ago
Social Network Discovery Based on Sensitivity Analysis
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
Tarik Crnovrsanin, Carlos D. Correa, Kwan-Liu Ma
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
16 years 26 days ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
136
Voted
DATE
2009
IEEE
112views Hardware» more  DATE 2009»
16 years 26 days ago
Package routability- and IR-drop-aware finger/pad assignment in chip-package co-design
—Due to increasing complexity of design interactions between the chip, package and PCB, it is essential to consider them at the same time. Specifically the finger/pad locations...
Chao-Hung Lu, Hung-Ming Chen, Chien-Nan Jimmy Liu,...
GLOBECOM
2009
IEEE
16 years 26 days ago
Robust Cooperative Relaying in a Wireless LAN: Cross-Layer Design and Performance Analysis
—A key technology in cooperative communications is distributed space-time coding (DSTC) which achieves spatial diversity gain from multiple relays. A novel DSTC, called randomize...
Pei Liu, Chun Nie, Elza Erkip, Shivendra S. Panwar
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
16 years 23 days ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason