Sciweavers

10988 search results - page 67 / 2198
» Algorithmic Folding Complexity
Sort
View
ISMB
1997
13 years 11 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 11 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 5 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
IEAAIE
2004
Springer
14 years 3 months ago
A New Edge-Grouping Algorithm for Multiple Complex Objects Localization
We present a new algorithm that provides an efficient localization method of elliptic industrial objects. Our proposed feature extraction inherits edge grouping approaches. But ins...
Yuichi Motai
IJCNN
2006
IEEE
14 years 4 months ago
Dynamic Hyperparameter Scaling Method for LVQ Algorithms
— We propose a new annealing method for the hyperparameters of several recent Learning Vector Quantization algorithms. We first analyze the relationship between values assigned ...
Sambu Seo, Klaus Obermayer