976 search results - page 47 / 196 » The Complexity of Timetable Construction Problems |
130
Voted
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
138
click to vote
COMPUTING
2008
15 years 2 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
113
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
131
click to vote
ACL
2012
13 years 4 months ago
2012
Polarity classification of words is important for applications such as Opinion Mining and Sentiment Analysis. A number of sentiment word/sense dictionaries have been manually or ...
132
click to vote
AAAI
2006
15 years 3 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...