1259 search results - page 79 / 252 » In search of the memoryless property |
ICCV
2009
IEEE
15 years 25 days ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
Ternary content addressable (TCAM) is favorable for high-speed search due to its parallel architecture and ability for searching arbitrary-length keys. However, the usage of TCAM ...
IWPC
2000
IEEE
14 years 7 days ago
2000
IEEE
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
WSS
2001
13 years 9 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...