2020 search results - page 13 / 404 » Speeding up Slicing |
163
click to vote
CIE
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
170
click to vote
ISMIR
2005
Springer
15 years 11 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
158
click to vote
TACAS
2007
Springer
15 years 12 months ago
2007
Springer
This paper studies the effect of bisimulation minimisation in model checking of monolithic discrete-time and continuous-time Markov chains as well as variants thereof with rewards...
141
click to vote
TCAD
2008
15 years 5 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
141
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we propose a novel hardware caching technique, called switch directory, to reduce the communication latency in CC-NUMA multiprocessors. The main idea is to implemen...