Sciweavers

598 search results - page 73 / 120
» A random graph model for massive graphs
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 1 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 28 days ago
Evolution of discrete gene regulatory models
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...
Afshin Esmaeili, Christian Jacob
CVPR
2009
IEEE
16 years 6 months ago
Topology Dictionary with Markov Model for 3D Video Content-Based Skimming and Description
This paper presents a novel approach to skim and describe 3D videos. 3D video is an imaging technology which consists in a stream of 3D models in motion captured by a synchronized ...
Tony Tung (Kyoto University), Takashi Matsuyama (K...
ICCSA
2010
Springer
15 years 1 months ago
Efficient Algorithms for the 2-Center Problems
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
Tadao Takaoka
ACTAC
2007
69views more  ACTAC 2007»
15 years 4 hour ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy