152 search results - page 15 / 31 » Sorting by reversals is difficult |
JUCS
2006
13 years 7 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
JIPS
2010
13 years 2 months ago
2010
This paper proposes a novel reversible data hiding scheme based on a Vector Quantization (VQ) codebook. The proposed scheme uses the principle component analysis (PCA) algorithm to...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Previous CASC competitions have focused on proving difficult problems on small numbers of axioms. However, typical reasoning applications for expert systems rely on knowledge base...
SDMW
2004
Springer
14 years 25 days ago
2004
Springer
ing and Refining Authorization in SQL Arnon Rosenthal, Edward Sciore1 The SQL standard specifies authorization via a large set of rather opaque rules, which are difficult to unders...