595 search results - page 59 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
139
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
123
click to vote
ISSTA
2009
ACM
15 years 10 months ago
2009
ACM
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
108
click to vote
EUROPAR
2000
Springer
15 years 7 months ago
2000
Springer
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
123
Voted
SDM
2010
SIAM
15 years 4 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
151
click to vote
ITC
1994
IEEE
15 years 7 months ago
1994
IEEE
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...