Sciweavers

1945 search results - page 245 / 389
» Pursuit-Evasion in Models of Complex Networks
Sort
View
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 8 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
INFOCOM
2010
IEEE
13 years 6 months ago
Optimal SINR-based Random Access
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong, Robe...
DATE
2005
IEEE
107views Hardware» more  DATE 2005»
14 years 1 months ago
Exploring NoC Mapping Strategies: An Energy and Timing Aware Technique
Complex applications implemented as Systems on Chip (SoCs) demand extensive use of system level modeling and validation. Their implementation gathers a large number of complex IP ...
César A. M. Marcon, Ney Laert Vilar Calazan...
ISBI
2011
IEEE
13 years 12 hour ago
Sparse topological data recovery in medical images
For medical image analysis, the test statistic of the measurements is usually constructed at every voxels in space and thresholded to determine the regions of significant signals...
Moo K. Chung, Hyekyoung Lee, Peter T. Kim, Jong Ch...
ANCS
2007
ACM
14 years 9 days ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos