Sciweavers

6833 search results - page 147 / 1367
» Some two-character sets
Sort
View
ACIVS
2010
Springer
15 years 2 months ago
Projection Selection Algorithms for Discrete Tomography
In this paper we study how the choice of projection angles affect the quality of the discrete tomographic reconstruction of an object. We supply four different strategies for selec...
László Varga, Péter Bal&aacut...
DAM
2011
14 years 11 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
KDD
2002
ACM
108views Data Mining» more  KDD 2002»
16 years 4 months ago
Incremental Machine Learning to Reduce Biochemistry Lab Costs in the Search for Drug Discovery
This paper promotes the use of supervised machine learning in laboratory settings where chemists have a large number of samples to test for some property, and are interested in id...
George Forman
KES
2005
Springer
15 years 10 months ago
Generalized Composite Motif Discovery
This paper discusses a general algorithm for the discovery of motif combinations. From a large number of input motifs, discovered by any single motif discovery tool, our algorithm ...
Geir Kjetil Sandve, Finn Drabløs
RTA
2005
Springer
15 years 10 months ago
Leanest Quasi-orderings
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
Nachum Dershowitz, E. Castedo Ellerman