1743 search results - page 185 / 349 » Generalized Modal Satisfiability |
180
Voted
SIGIR
2005
ACM
16 years 16 days ago
2005
ACM
Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model’s empirica...
165
click to vote
ATAL
2005
Springer
16 years 16 days ago
2005
Springer
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
196
click to vote
ICLP
2005
Springer
16 years 15 days ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
165
click to vote
WCC
2005
Springer
16 years 14 days ago
2005
Springer
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
216
Voted
COMPGEOM
2004
ACM
16 years 12 days ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...