Search Results - "F.2.2[Nonnumerical Algorithms and problems]"

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions by Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This…”
Get full text

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF by Beyersdorff, Olaf, Blinkhorn, Joshua, Chew, Leroy, Schmidt, Renate, Suda, Martin

“…Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF…”
Get full text

A method for improving full text search using signature files by Yamakawa, Yoshihiro, Fuketa, Masao, Morita, Kazuhiro, Aoe, Jun-ichi

“…Efficiency of full text retrieval using signatures depends on the number of filtering and the reduction of the original text, but there has been no discussion…”
Get full text

A link trie structure of storing multiple attribute relationships for natural language dictionaries by Morita, Kazuhiro, Koyama, Masafumi, Fuketa, Masao, Aoe, Jun-Ichi

“…Word relation is primitive knowledge and it is very useful for natural language processing systems. In the traditional systems, although each knowledge…”
Get full text

A fast retrieval technique for large graph structures by Iriguchi, Hirokazu, Koyama, Masashi, Shishibori, Masami, Aoe, Jun-Ichi

“…Graphs are a typical and basic data structure for computer algorithms. A two-dimensional array and a list are well-known as for their representation. These…”
Get full text

An algorithm for dynamic processing of dawg's by Park, Ki-Hong, Aoe, Jun-Ichi, Morimoto, Katsushi, Shishibori, Masami

“…SCOPE: Algorithms, Information storage and retrieval. A trie is a search tree obtained by merging the common suffixes of the key set. It has the advantage that…”
Get full text

Some results of the relocation problems with processing times and deadlines by Lin, Miao-Tsong, Tseng, Shian-Shyong

“…The relocation problem originates from the public housing project so as to minimize the budgets. Given a set of jobs each demands nt units of resources for…”
Get full text

An optimal schedule for printing and binding by Chin, Francis, Wong, Michael

“…An optimal solution is presented for the scheduling of printing and binding of a book order. The algorithm is simpler and faster than previously known methods…”
Get full text

PARADIGMS ADMITTING SUPERUNITARY BEHAVIOUR IN PARALLEL COMPUTATION by AKL, S. G., LINDON, L. FAVA

“…With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold…”
Get full text

Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories by Spyropoulos, C.D., Evans, D.J

“…This paper presents the extreme performance of the promising Q.A.D. algorithm, for scheduling independent jobs under few pre-set ordering rules on the examined…”
Get full text

Faster Graph Coloring in Polynomial Space by Gaspers, Serge, Lee, Edward J.

“…We present a polynomial-space algorithm that computes the number of independent sets of any input graph in time O ( 1 . 1389 n ) for graphs with maximum degree…”
Get full text

Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms by Murray, Riley, Khuller, Samir, Chao, Megan

“…The Map-Reduce computing framework rose to prominence with datasets of such size that dozens of machines on a single cluster were needed for individual jobs…”
Get full text