Sciweavers

450 search results - page 28 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
137
Voted
ICASSP
2011
IEEE
14 years 7 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
125
Voted
NJC
2006
86views more  NJC 2006»
15 years 3 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
124
Voted
LPAR
2010
Springer
15 years 1 months ago
Automated Proof Compression by Invention of New Definitions
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
Jirí Vyskocil, David Stanovský, Jose...
IPL
2011
109views more  IPL 2011»
14 years 10 months ago
Nondominated local coteries for resource allocation in grids and clouds
The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the...
Jehn-Ruey Jiang
119
Voted
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 7 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock