130 search results - page 23 / 26 » Binary Representations for General CSPs |
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
EMNLP
2009
13 years 6 months ago
2009
This paper presents a parse-and-paraphrase paradigm to assess the degrees of sentiment for product reviews. Sentiment identification has been well studied; however, most previous ...
PLDI
2004
ACM
14 years 2 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
ASPLOS
2008
ACM
13 years 10 months ago
2008
ACM
The C programming language is at least as well known for its absence of spatial memory safety guarantees (i.e., lack of bounds checking) as it is for its high performance. C'...
IVC
2008
13 years 8 months ago
2008
We consider the problem of extracting features for multi-class recognition problems. The features are required to make fine distinction between similar classes, combined with tole...