Sciweavers

1144 search results - page 40 / 229
» Logic programming for combinatorial problems
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Sparse decompositions in "incoherent" dictionaries
The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We conside...
Morten Nielsen, Rémi Gribonval
ICLP
1999
Springer
13 years 12 months ago
Logic Programming in Oz with Mozart
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...
Peter Van Roy
MVA
1998
230views Computer Vision» more  MVA 1998»
13 years 9 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
MLG
2007
Springer
14 years 1 months ago
Graphs, Hypergraphs, and Inductive Logic Programming
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
Hendrik Blockeel, Tijn Witsenburg, Joost N. Kok
ML
2008
ACM
174views Machine Learning» more  ML 2008»
13 years 7 months ago
ALLPAD: approximate learning of logic programs with annotated disjunctions
In this paper we present the system ALLPAD for learning Logic Programs with Annotated Disjunctions (LPADs). ALLPAD modifies the previous system LLPAD in order to tackle real world ...
Fabrizio Riguzzi