Sciweavers

1261 search results - page 198 / 253
» Approximation algorithms for aligning points
Sort
View
SIGMOD
1989
ACM
94views Database» more  SIGMOD 1989»
15 years 1 months ago
Redundancy in Spatial Databases
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
Jack A. Orenstein
ECML
2007
Springer
15 years 1 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass
FSE
2007
Springer
142views Cryptology» more  FSE 2007»
15 years 1 months ago
A New Class of Weak Keys for Blowfish
The reflection attack is a recently discovered self similarity analysis which is usually mounted on ciphers with many fixed points. In this paper, we describe two reflection attack...
Orhun Kara, Cevat Manap
CATS
2007
14 years 11 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
IMAMS
2007
157views Mathematics» more  IMAMS 2007»
14 years 11 months ago
Regularity Criteria for the Topology of Algebraic Curves and Surfaces
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
Lionel Alberti, Bernard Mourrain