Sciweavers

3897 search results - page 706 / 780
» complexity 2010
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
EUROSYS
2010
ACM
14 years 2 months ago
Residue objects: a challenge to web browser security
A complex software system typically has a large number of objects in the memory, holding references to each other to implement an object model. Deciding when the objects should be...
Shuo Chen, Hong Chen, Manuel Caballero
IWCMC
2010
ACM
14 years 2 months ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy
PLDI
2010
ACM
14 years 2 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn
PLDI
2010
ACM
14 years 2 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund