Sciweavers

270 search results - page 6 / 54
» A determinant property of Catalan numbers
Sort
View
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 1 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
11 years 10 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
RV
2010
Springer
128views Hardware» more  RV 2010»
13 years 5 months ago
Reducing Configurations to Monitor in a Software Product Line
A product line is a family of programs where each program is defined by a unique combination of features. Product lines, like conventional programs, can be checked for safety prope...
Chang Hwan Peter Kim, Eric Bodden, Don S. Batory, ...
AICT
2008
IEEE
119views Communications» more  AICT 2008»
13 years 7 months ago
Simplification of Frequency Test for Random Number Generation Based on Chi-Square
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...
Kruawan Wongpanya, Keattisak Sripimanwat, Kanok Je...
AI
2007
Springer
13 years 7 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne