264 search results - page 23 / 53 » On the possibility of faster SAT algorithms |
IH
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that t...
ECOOP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
118
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
We present a new algorithm for a robust family of Earth Mover’s Distances - EMDs with thresholded ground distances. The algorithm transforms the flow-network of the EMD so that t...
DASFAA
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract. Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as s...
ASYNC
2001
IEEE
15 years 3 months ago
2001
IEEE
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...