23 search results - page 5 / 5 » Exact Algorithms for NP-Hard Problems: A Survey |
DAGSTUHL
2003
13 years 6 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
SIGMOD
2003
ACM
14 years 5 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
SAGA
2001
Springer
13 years 9 months ago
2001
Springer
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...