Sciweavers

468 search results - page 84 / 94
» One-Way Functions in Complexity Theory
Sort
View
86
Voted
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 4 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IPSN
2007
Springer
15 years 5 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
93
Voted
APLAS
2005
ACM
15 years 4 months ago
Integrating Physical Systems in the Static Analysis of Embedded Control Software
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
Patrick Cousot
98
Voted
PPDP
2005
Springer
15 years 4 months ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet
112
Voted
PDC
2004
ACM
15 years 4 months ago
From small scale to large scale user participation: a case study of participatory design in e-government systems
Most experiments with participative design are with small scale, stand alone and not very strategic applications of ICT in organizations. However, modern ICT applications are incr...
Anne-Marie Oostveen, Peter Van den Besselaar