6315 search results - page 840 / 1263 » Approximating Solution Structure |
175
click to vote
ESORICS
2009
Springer
16 years 8 months ago
2009
Springer
Abstract. As the number and scope of government regulations and rules mandating trustworthy retention of data keep growing, businesses today are facing a higher degree of regulatio...
328
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
204
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
187
click to vote
ICFP
2006
ACM
16 years 7 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
189
click to vote
ICCD
2005
IEEE
16 years 4 months ago
2005
IEEE
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...