Sciweavers

56 search results - page 6 / 12
» Computing the Determinant and Smith Form of an Integer Matri...
Sort
View
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
13 years 11 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...
Samir Siksek, Michael Stoll
EMMCVPR
2007
Springer
14 years 1 months ago
3D Computation of Gray Level Co-occurrence in Hyperspectral Image Cubes
This study extended the computation of GLCM (gray level co-occurrence matrix) to a three-dimensional form. The objective was to treat hyperspectral image cubes as volumetric data s...
Fuan Tsai, Chun-Kai Chang, Jian-Yeo Rau, Tang-Huan...
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 7 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
LICS
2009
IEEE
14 years 2 months ago
Logics with Rank Operators
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Lau...
JPDC
2008
122views more  JPDC 2008»
13 years 7 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...