Sciweavers

1477 search results - page 215 / 296
» Complexity of (iterated) dominance
Sort
View
PODC
2006
ACM
14 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ICCV
2005
IEEE
14 years 3 months ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 3 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
ICWE
2004
Springer
14 years 3 months ago
Modeling the Structure of Web Applications with ArgoUWE
The UWE methodology provides a systematic, UML-based approach for the development of Web applications. The CASE tool ArgoUWE supports the design phase of the UWE development proces...
Alexander Knapp, Nora Koch, Gefei Zhang
EMSOFT
2009
Springer
14 years 1 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond