Sciweavers

413 search results - page 61 / 83
» On the Relation Between ID-Logic and Answer Set Programming
Sort
View
ACL
2001
13 years 9 months ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
Alain Lecomte, Christian Retoré
ICASSP
2010
IEEE
13 years 7 months ago
Clustering disjoint subspaces via sparse representation
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
Ehsan Elhamifar, René Vidal
WWW
2011
ACM
13 years 2 months ago
Filtering microblogging messages for social TV
Social TV was named one of the ten most important emerging technologies in 2010 by the MIT Technology Review. Manufacturers of set-top boxes and televisions have recently started ...
Ovidiu Dan, Junlan Feng, Brian D. Davison
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 5 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
FPGA
2004
ACM
119views FPGA» more  FPGA 2004»
14 years 1 months ago
A quantitative analysis of the speedup factors of FPGAs over processors
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported. This paper presents an analysis, both quantitative a...
Zhi Guo, Walid A. Najjar, Frank Vahid, Kees A. Vis...