318 search results - page 31 / 64 » Real Number Computability and Domain Theory |
CCS
2007
ACM
14 years 3 months ago
2007
ACM
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
MMSEC
2006
ACM
14 years 2 months ago
2006
ACM
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
COMGEO
2012
ACM
12 years 4 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
COLING
2002
13 years 8 months ago
2002
With the rapid growth of real application domains for NLP systems, there is a genuine demand for a general toolkit from which programmers with no linguistic knowledge can build sp...