Sciweavers

11160 search results - page 204 / 2232
» Incompleteness in a General Setting
Sort
View
CL
2000
Springer
15 years 8 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
DAGSTUHL
2009
15 years 5 months ago
Median Topographic Maps for Biomedical Data Sets
Abstract. Median clustering extends popular neural data analysis methods such as the self-organizing map or neural gas to general data structures given by a dissimilarity matrix on...
Barbara Hammer, Alexander Hasenfuss, Fabrice Rossi
IPL
2006
69views more  IPL 2006»
15 years 4 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
TCBB
2008
76views more  TCBB 2008»
15 years 4 months ago
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...
Michael D. Hendy, Sagi Snir
JMIV
2007
136views more  JMIV 2007»
15 years 4 months ago
Image Compression Through a Projection onto a Polyhedral Set
In image denoising, many researchers have tried for several years to combine wavelet-like approaches and optimization methods (typically based on the total variation minimization)...
François Malgouyres