8728 search results - page 347 / 1746 » On Reduct Construction Algorithms |
157
click to vote
ICIAR
2009
Springer
16 years 1 months ago
2009
Springer
This paper considers the problem of altering an image by imperceptibly adding or removing pixels, for example, to fit a differently shaped frame with minimal loss of interesting ...
217
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
161
click to vote
COCO
2007
Springer
16 years 28 days ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
193
click to vote
SLIP
2003
ACM
16 years 10 hour ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
137
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...