Sciweavers

279 search results - page 36 / 56
» A Name Abstraction Functor for Named Sets
Sort
View
ASP
2003
Springer
14 years 2 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
BIRTHDAY
2003
Springer
14 years 2 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 2 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
ECCV
2010
Springer
14 years 1 months ago
Building Compact Local Pairwise Codebook with Joint Feature Space Clustering
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...
FOCS
2002
IEEE
14 years 1 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich