Sciweavers

3229 search results - page 450 / 646
» The Theory of Timed Automata
Sort
View
SENSYS
2009
ACM
16 years 1 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
MEMOCODE
2006
IEEE
16 years 20 days ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
CSCW
2004
ACM
16 years 2 days ago
Six degrees of jonathan grudin: a social network analysis of the evolution and impact of CSCW research
In this paper, we describe the evolution and impact of computersupported cooperative work (CSCW) research through social network analysis of coauthorship data. A network of author...
Daniel B. Horn, Thomas A. Finholt, Jeremy P. Birnh...
COMPGEOM
2010
ACM
15 years 11 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 11 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman