1058 search results - page 63 / 212 » It's Doomed; We Can Prove It |
ENTCS
2007
13 years 10 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
GRC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Zadeh proposed the paradigm of computing with words (CWW). We have proposed a CWW architecture for making subjective judgments, called a Perceptual Computer (PerC). Because wor...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...