Sciweavers

552 search results - page 66 / 111
» Lower bounds for dynamic connectivity
Sort
View
ICCAD
2000
IEEE
102views Hardware» more  ICCAD 2000»
14 years 1 months ago
Provably Good Global Buffering Using an Available Buffer Block Plan
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
13 years 9 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
IAT
2005
IEEE
14 years 2 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi
BMCBI
2010
183views more  BMCBI 2010»
13 years 6 months ago
The complexity of gene expression dynamics revealed by permutation entropy
Background: High complexity is considered a hallmark of living systems. Here we investigate the complexity of temporal gene expression patterns using the concept of Permutation En...
Xiaoliang Sun, Yong Zou, Victoria J. Nikiforova, J...
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
14 years 2 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor