Sciweavers

2808 search results - page 429 / 562
» Routing betweenness centrality
Sort
View
130
Voted
TON
2002
99views more  TON 2002»
15 years 4 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
148
Voted
TWC
2010
14 years 11 months ago
Pi: a practical incentive protocol for delay tolerant networks
Delay Tolerant Networks (DTNs) are a class of networks characterized by lack of guaranteed connectivity, typically low frequency of encounters between DTN nodes and long propagatio...
Rongxing Lu, Xiaodong Lin, Haojin Zhu, Xuemin Shen...
ISPD
2012
ACM
289views Hardware» more  ISPD 2012»
14 years 17 days ago
Keep it straight: teaching placement how to better handle designs with datapaths
As technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell com...
Samuel I. Ward, Myung-Chul Kim, Natarajan Viswanat...
CVPR
2004
IEEE
16 years 7 months ago
2D-Shape Analysis Using Conformal Mapping
The study of 2D shapes and their similarities is a central problem in the field of vision. It arises in particular from the task of classifying and recognizing objects from their ...
Eitan Sharon, David Mumford
ACSAC
2007
IEEE
15 years 11 months ago
Retrofitting the IBM POWER Hypervisor to Support Mandatory Access Control
Server virtualization more readily enables the collocation of disparate workloads on a shared physical platform. When employed on systems across a data center, the result can be a...
Enriquillo Valdez, Reiner Sailer, Ronald Perez