204 search results - page 39 / 41 » Parameterizations of Test Cover with Bounded Test Sizes |
STACS
2010
Springer
14 years 1 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
RTSS
2007
IEEE
14 years 9 days ago
2007
IEEE
It is challenging to process transactions in a timely fashion using fresh data, e.g., current stock prices, since database workloads may considerably vary due to dynamic data/reso...
PLDI
2010
ACM
13 years 11 months ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
ESOP
2001
Springer
13 years 10 months ago
2001
Springer
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
VISUALIZATION
1997
IEEE
13 years 10 months ago
1997
IEEE
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraf...