Sciweavers

391 search results - page 26 / 79
» Structural and algorithmic issues of dynamic protocol update
Sort
View
133
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 3 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
SENSYS
2004
ACM
15 years 8 months ago
The flooding time synchronization protocol
Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. Thi...
Miklós Maróti, Branislav Kusy, Gyula...
GCC
2005
Springer
15 years 8 months ago
Incorporating Data Movement into Grid Task Scheduling
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
Xiaoshan He, Xian-He Sun
CVPR
2011
IEEE
14 years 10 months ago
Online Detection of Unusual Events in Videos via Dynamic Sparse Coding
Real-time unusual event detection in video stream has been a difficult challenge due to the lack of sufficient training information, volatility of the definitions for both norm...
Bin Zhao, Li Fei-Fei, Eric Xing
RECOMB
2001
Springer
15 years 7 months ago
Extracting structural information using time-frequency analysis of protein NMR data
High-throughput, data-directed computational protocols for Structural Genomics (or Proteomics) are required in order to evaluate the protein products of genes for structure and fu...
Christopher James Langmead, Bruce Randall Donald