WorldCat Identities

Andonov, Rumen

Overview
Works: 37 works in 64 publications in 2 languages and 70 library holdings
Roles: Author, Thesis advisor, Opponent, Other
Publication Timeline
.
Most widely held works by Rumen Andonov
Algorithm engineering and VLSI design by William Marnane( Book )

5 editions published in 1993 in English and held by 8 WorldCat member libraries worldwide

Optimal tiling by R Andonov( Book )

4 editions published between 1993 and 1994 in English and held by 6 WorldCat member libraries worldwide

Efficient linear systolic array for the knapsack problem = Une architecture systolique pour le problème du sac-à-dos by R Andonov( Book )

3 editions published in 1992 in English and French and held by 4 WorldCat member libraries worldwide

It is an improvement on the usual strategies used for backtracking which have a time complexity [theta](m + c)."
An optimal algo-tech-cuit for the knapsack problem by Rumen Andonov( Book )

3 editions published between 1993 and 1994 in English and held by 4 WorldCat member libraries worldwide

A sparse knapsack algo-tech-cuit and its synthesis by R Andonov( Book )

3 editions published in 1994 in English and held by 4 WorldCat member libraries worldwide

Dynamic programming parallel implementations for the knapsack problem by R Andonov( Book )

3 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide

A systolic linear array for the 0/1 knapsack problem by Rumen Andonov( Book )

2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide

Abstract: "A modular systolic linear array for the 0/1 Knapsack problem is described. The design consists of a unidirectional array of homogeneous elementary cells making the array completely modular and extensible. Each cell has a fixed storage capacity of size [alpha], where [alpha] is a parameter of the design. For a problem of size m and capacity of the knapsack c a linear array of m[c/[alpha]] cells is proposed solving the problem in T=c+m[c/[alpha]]+m time-steps. The modularity of the array permits to solve larger problems only by using more cells, without any modification in the design and/or in the cell program."
Unbounded Knapsack Problem : Dynamic Programming Revisited by Rumen Andonov( Book )

3 editions published in 1997 in English and held by 3 WorldCat member libraries worldwide

Systematic design of wavefront array processors : a case study by R Andonov( Book )

3 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide

The protein threading problem is in P? by Nicola Yanev( Book )

3 editions published in 2002 in English and held by 3 WorldCat member libraries worldwide

Optimal semi-oblique tiling by Rumen Andonov( Book )

2 editions published in 2001 in English and held by 2 WorldCat member libraries worldwide

Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR) by Nicolas Bloyet( )

1 edition published in 2019 in French and held by 2 WorldCat member libraries worldwide

In the field of chemistry, it is interesting to be able to estimate the physicochemical properties of molecules, especially for industrial applications. These are difficult to estimate by physical simulations, as their implementation often present prohibitive time complexity. However, the emergence of data (public or private) opens new perspectives for the treatment of these problems by statistical methods and machine learning. The main difficulty lies in the characterization of molecules: these are more like a network of atoms (in other words a colored graph) than a vector. Unfortunately, statistical modeling methods usually deal with observations encoded as such, hence the need for specific methods able to deal with graphs- encoded observations, called structure-activity relationships. The aim of this thesis is to take advantage of public corpora to learn the best possible representations of these structures, and to transfer this global knowledge to smaller datasets. We adapted methods used in automatic processing of natural languages to achieve this goal. To implement them, more theoretical work was needed, especially on the graph isomorphism problem. The results obtained on classification / regression tasks are at least competitive with the state of the art, and even sometimes better, in particular on restricted data sets, attesting some opportunities for transfer learning in this field
Contributions à la parallélisation efficace des nids de boucles : pavage optimal appliqué à la programmation dynamique by Benamar Sidi Boulenouar( Book )

2 editions published in 2001 in French and held by 2 WorldCat member libraries worldwide

Modélisation grande échelle de réseaux biologiques : vérification par contraintes booléennes de la cohérence des données by Philippe Veber( Book )

2 editions published in 2007 in French and held by 2 WorldCat member libraries worldwide

Les techniques de biologie moléculaire haut-débit permettent de mesurer un grand nombre de variables simultanément. Nous abordons la question de leur intégration : comment combiner les différentes sources dans un modèle et en tirer des conclusions pertinentes ? Nous introduisons un critère de consistance entre un modèle graphique des régulations cellulaires et des données de déplacement d'équilibre. Nous montrons ensuite comment l'utiliser pour obtenir des prédictions ou proposer des corrections en cas d'incompatibilité. Ces différentes tâches impliquent la résolution de contraintes à variables sur domaines finis, pour lesquelles nous proposons deux approches complémentaires. L'utilisation de ces techniques est illustrée avec des données réelles sur la bactérie E. coli et sur la levure. Nous montrons enfin, sur ces données, comment notre critère de consistance nous permet d'arriver à des prédictions robustes, ainsi que des corrections pertinentes du modèle étudié
Apprentissage d'automates modélisant des familles de séquences protéiques by Goulven Kerbellec( Book )

2 editions published in 2008 in French and held by 2 WorldCat member libraries worldwide

This thesis shows a new approach out of discovering protein families signatures. Given a sample of (unaligned) sequences belonging to a structural or functional family of proteins, this approach infers non-deterministic automata characterizing the family. A new kind of multiple alignment called PLMA is introduced in order to emphasize the partial and local significant similarities. Given this information, the NFA models are produced by a process stemming from the domain of grammatical inference. The NFA models, presented here under the name of Protomata, are discreet graphical models of strong expressiveness, which distinguishes them from statistical models such as HMM profiles or pattern models like Prosite patterns. The experiments led on various biological families, among which the MIP and the TNF, show a success on real data
Optimisation discrète et parallélisme : interactions et applications by Stefan Balev( Book )

1 edition published in 2001 in English and held by 1 WorldCat member library worldwide

L'optimisation discrète est le noyau fédérateur de la thèse. Pour résoudre les problèmes NP-complets du domaine, les trois directions suivantes sont explorées : (i) la conception d'algorithmes efficaces par la voie d'hybridation des techniques classiques de résolution, ainsi que par l'exploitation des propriétés fondamentales du problème ; (ii) l'élaboration de méthodes heuristiques pour traiter des instances inaccessibles par les méthodes exactes ; (iii) l'utilisation performante du parallélisme pour la résolution des problèmes combinatoires. L'application d'optimisation discrète dans le parallélisme est aussi abordée dans la thèse. La parallélisation efficace d'un algorithme engendre de nombreux problèmes d'optimisation discrète, liés à l'équilibrage de charge entre processeurs, à la granularité optimale du calcul et à la réduction du surcoût de communication. Thèmes principaux : (i) problème de classification (problème d'analyse discriminante linéaire) - conception d'algorithmes efficaces séquentiels et parallèles ; (ii) problème de sac-à-dos multidimensionnel en variables 0-1 - hybridation de programmation dynamique et un système de bornes ; (iii) ordonnancement de systèmes d'équations récurrentes affines - utilisation de programmation linéaire et comparaison des méthodes différentes ; (iv) problème de pavage optimal de l'espace d'iterations pour parallelisation de nids de boucles - détermination de paramètres optimaux du pavage et application de l'approche pour comparaison de séquences génomiques
Optimal tiling by Rumen Andonov( Book )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

Optimal tiling for the RNA base pairing problem by Francisco Almeida( Book )

1 edition published in 2002 in English and held by 1 WorldCat member library worldwide

Sur quelques problèmes algorithmiques relatifs à la détermination de structure à partir de données de spectrométrie de masse by Deepesh Agarwal( )

1 edition published in 2015 in English and held by 1 WorldCat member library worldwide

Mass spectrometry (MS), an analytical technique initially invented to deal with small molecules, has emerged over the past decade as a key approach in structural biology. The recent advances have made it possible to transfer large macromolecular assemblies into the vacuum without their dissociation, raising challenging algorithmic problems. This thesis makes contributions to three such problems. The first contribution deals with stoichiometry determination (SD), namely the problem of determining the number of copies of each subunit of an assembly, from mass measurements. We deal with the interval SD problem, where the target mass belongs to an interval accounting for mass measurement uncertainties. We present a constant memory space algorithm (DIOPHANTINE), and an output sensitive dynamic programming based algorithm (DP++), outperforming state-of-the-art methods both for integer type and float type problems. The second contribution deals with the inference of pairwise contacts between subunits, using a list of sub-complexes whose composition is known. We introduce the Minimum Connectivity Inference problem (MCI) and present two algorithms solving it. We also show an excellent agreement between the contacts reported by these algorithms and those determined experimentally. The third contribution deals with Minimum Weight Connectivity Inference (MWCI), a problem where weights on candidate edges are available, reflecting their likelihood. We present in particular a bootstrap algorithm allowing one to report a set of edges with improved sensitivity and specificity with respect to those obtaining upon solving MCI
Recent advances in solving the protein threading problem( Book )

1 edition published in 2007 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.00 (from 0.00 for Algorithm ... to 0.00 for Algorithm ...)

Alternative Names
Rumen Andonov wetenschapper

Languages
English (38)

French (8)