572 search results - page 91 / 115 » Exponential-Time Approximation of Hard Problems |
101
click to vote
SIGMOD
2011
ACM
14 years 24 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
164
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
IPSN
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
102
click to vote
OOPSLA
2005
Springer
15 years 3 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...