منابع مشابه
Binary Search and Recursive Graph Problems
A graph G = (V,E) is recursive if every node of G has a finite number of neighbors, and both V and E are recursive (i.e., decidable). We examine the complexity of identifying the number of connected components of an infinite recursive graph, and other related problems, both when an upper bound to that value is given a priori or not. The problems that we deal with are unsolvable, but are recursi...
متن کاملBinary Recursive
Binary recursive partitioning (BRP) is a computationally-intensive statistical method that can be used in situations where linear models are often used. Instead of imposing many assumptions to arrive at a tractable statistical model, BRP simply seeks to accurately predict a response variable based on values of predictor variables. The method outputs a decision tree depicting the predictor varia...
متن کاملGeneralized Binary Search For Split-Neighborly Problems
In sequential hypothesis testing, Generalized Binary Search (GBS) greedily chooses the test with the highest information gain at each step. It is known that GBS obtains the gold standard query cost of O(log n) for problems satisfying the k-neighborly condition, which requires any two tests to be connected by a sequence of tests where neighboring tests disagree on at most k hypotheses. In this p...
متن کاملRecursive and Iterative Algorithms for N-ary Search Problems
The paper analyses and compares alternative iterative and recursive implementations of N-ary search algorithms in hardware (in field programmable gate arrays, in particular). The improvements over the previous results have been achieved with the aid of the proposed novel methods for the fast implementation of hierarchical algorithms. The methods possess the following distinctive features: 1) pr...
متن کاملEfficient Algorithms for Geometric Graph Search Problems
In this paper, we show that many graph search problems can be solved quite efficiently for a geometric intersection graph ofhorizontal and vertical line segments. We first extract several basic operations for depth first search and breadth first search on a graph. Then we present data structures for the intersection graph in terms of which those operations can be implemented in an efficient man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00266-6