Sciweavers

2489 search results - page 307 / 498
» On the Subgroup Distance Problem
Sort
View
AI
1998
Springer
15 years 8 months ago
Sequential Instance-Based Learning
This paper presents and evaluates sequential instance-based learning (SIBL), an approach to action selection based upon data gleaned from prior problem solving experiences. SIBL le...
Susan L. Epstein, Jenngang Shih
131
Voted
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 8 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
123
Voted
MINAR
1998
Springer
113views Multimedia» more  MINAR 1998»
15 years 8 months ago
Envelope Parameter Calculation of Similarity Indexing Structure
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
Xuesheng Bai, Guangyou Xu, Yuanchun Shi
SOFSEM
1997
Springer
15 years 8 months ago
Path Layout in ATM Networks
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
Shmuel Zaks
134
Voted
CIBCB
2007
IEEE
15 years 8 months ago
Hybrid Architecture for Accelerating DNA Codeword Library Searching
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
Qinru Qiu, Daniel J. Burns, Qing Wu, Prakash Mukre