7106 search results - page 1320 / 1422 » Restricted Complexity, General Complexity |
152
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
175
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
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 ...
135
click to vote
EUROSYS
2010
ACM
15 years 9 months ago
2010
ACM
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...
141
Voted
IWCMC
2010
ACM
15 years 9 months ago
2010
ACM
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...
136
click to vote
PLDI
2010
ACM
15 years 9 months ago
2010
ACM
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...