1387 search results - page 263 / 278 » Convexity in Discrete Space |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
AMIRE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce mathematically rigorous metrics on agent experiences having various temporal horizons. Sensorimotor variables accessible to the agent are treated as informat...
IWCIA
2004
Springer
14 years 27 days ago
2004
Springer
We consider selected geometric properties of 2D or 3D sets, given in form of binary digital pictures, and discuss their estimation. The properties examined are perimeter and area i...