1421 search results - page 70 / 285 » Algorithms for subsequence combinatorics |
140
click to vote
IWANN
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Microshrinkages are known as probably the most difficult defects to avoid in high-precision foundry. The presence of this failure renders the casting invalid, with the su...
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
The key idea behind Inspector Joins is that during the I/O partitioning phase of a hash-based join, we have the opportunity to look at the actual data itself and then use this kno...
133
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper we propose a new compression algorithm geared to reduce the time needed to test scan-based designs. Our scheme compresses the test vector set by encoding the bits th...
134
click to vote
ICSE
1998
IEEE-ACM
15 years 7 months ago
1998
IEEE-ACM
Program slicing, a technique to compute the subset of program statements that can affect the value of a program variable at a specific program point, is widely used in tools to su...
198
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...