4305 search results - page 563 / 861 » The Test of Time |
155
click to vote
JCO
2010
15 years 5 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
181
click to vote
VLSID
1998
IEEE
15 years 11 months ago
1998
IEEE
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
177
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
182
click to vote
SIGSOFT
2008
ACM
16 years 7 months ago
2008
ACM
In software development, bug reports provide crucial information to developers. However, these reports widely differ in their quality. We conducted a survey among developers and u...
294
Voted
CP
2009
Springer
16 years 7 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...