Sciweavers

922 search results - page 9 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
117
Voted
ICASSP
2011
IEEE
14 years 5 months ago
A general framework for robust HOSVD-based indexing and retrieval with high-order tensor data
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
Qun Li, Xiangqiong Shi, Dan Schonfeld
JAIR
2011
103views more  JAIR 2011»
14 years 8 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
90
Voted
CSR
2009
Springer
15 years 8 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
82
Voted
JCT
2000
81views more  JCT 2000»
15 years 1 months ago
Generalized Rook Polynomials
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
Jay Goldman, James Haglund
120
Voted
CADE
2009
Springer
16 years 2 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning