Sciweavers

12194 search results - page 2439 / 2439
» cans 2010
Sort
View
COMPGEOM
2010
ACM
14 years 16 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
ECOOP
2010
Springer
14 years 7 days ago
The Essence of JavaScript
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi
SIGCOMM
2010
ACM
13 years 7 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
JSYML
2010
114views more  JSYML 2010»
13 years 5 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
« Prev « First page 2439 / 2439 Last » Next »