Sciweavers

3169 search results - page 257 / 634
» Robust Timed Automata
Sort
View
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 7 months ago
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
Andrew V. Goldberg
PAMI
2007
196views more  PAMI 2007»
15 years 5 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
SENSYS
2004
ACM
15 years 11 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...
CCGRID
2006
IEEE
16 years 3 days ago
Statistical Properties of Task Running Times in a Global-Scale Grid Environment
— Over the years, the use of global grid environments have become widespread. In order to make applications robust against the dynamics of those grid environments it is essential...
Menno Dobber, Robert D. van der Mei, Ger Koole
BC
2004
114views more  BC 2004»
15 years 5 months ago
Spike timing and synaptic plasticity in the premotor pathway of birdsong
Abstract. The neural circuits of birdsong appear to utilize specific time delays in their operation. In particular, the anterior forebrain pathway (AFP) is implicated in an approxi...
Henry D. I. Abarbanel, Leif Gibb, Gabriel B. Mindl...