Sciweavers

8636 search results - page 302 / 1728
» How Developers Copy
Sort
View
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 7 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
POPL
2005
ACM
16 years 7 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 7 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
ICFP
2004
ACM
16 years 6 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
MOBIHOC
2008
ACM
16 years 6 months ago
The networking shape of vehicular mobility
Mobility is the distinguishing feature of vehicular networks, affecting the evolution of network connectivity over space and time in a unique way. Connectivity dynamics, in turn, ...
Marco Fiore, Jérôme Härri