153 search results - page 22 / 31 » Solving Demand Versions of Interprocedural Analysis Problems |
MMB
2004
Springer
14 years 26 days ago
2004
Springer
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...