Sciweavers

143 search results - page 6 / 29
» Combination of Among and Cardinality Constraints
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
13 years 11 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano
EDBT
1992
ACM
79views Database» more  EDBT 1992»
14 years 2 months ago
Theoretical Aspects of Schema Merging
A general technique for merging database schemas is developed that has a number of advantages over existing techniques, the most important of which is that schemas are placed in a...
Peter Buneman, Susan B. Davidson, Anthony Kosky
ACL
1996
14 years 5 days ago
Combining Trigram-based and Feature-based Methods for Context-Sensitive Spelling Correction
This paper addresses the problem of correcting spelling errors that result in valid, though unintended words (such as peace and piece, or quiet and quite) and also the problem of ...
Andrew R. Golding, Yves Schabes
ICML
2008
IEEE
14 years 11 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
13 years 10 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu