1620 search results - page 75 / 324 » Testing Polymorphic Properties |
127
Voted
ECCC
2000
15 years 2 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
121
Voted
DFT
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper we analyze the performance of a mixed built-in-self-test (BiST) for RF IC digital transceivers, where a baseband processor can be used both as a test pattern generat...
137
click to vote
KBSE
2003
IEEE
15 years 7 months ago
2003
IEEE
Database application programs are often designed to be executed concurrently by many clients. By grouping related database queries into transactions, DBMS systems can guarantee th...
91
Voted
TALG
2008
15 years 2 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
213
Voted
COCOA
2011
Springer
14 years 2 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...