Sciweavers

4488 search results - page 404 / 898
» Properties of NP-Complete Sets
Sort
View
JAR
2010
98views more  JAR 2010»
15 years 2 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
207
Voted
JMLR
2010
135views more  JMLR 2010»
15 years 2 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
190
Voted
SIAMMAX
2010
103views more  SIAMMAX 2010»
15 years 2 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý
178
Voted
TC
2010
15 years 2 months ago
Performability Analysis of Multistate Computing Systems Using Multivalued Decision Diagrams
A distinct characteristic of multistate systems (MSS) is that the systems and/or their components may exhibit multiple performance levels (or states) varying from perfect operation...
Suprasad V. Amari, Liudong Xing, Akhilesh Shrestha...
196
Voted
TCS
2010
15 years 2 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal