27 search results - page 4 / 6 » Interval Stabbing Problems in Small Integer Ranges |
WADS
2009
Springer
15 years 4 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
LCTRTS
2007
Springer
15 years 3 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
DATE
1998
IEEE
15 years 2 months ago
1998
IEEE
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
MOC
1998
14 years 9 months ago
1998
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...