4553 search results - page 312 / 911 » Distributed Ranked Search |
165
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
218
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Screening is an important task to convert a continuoustone image into a binary image with pure black and white pixels. The main contribution of this paper is to show a new algorit...
177
click to vote
IPPS
2006
IEEE
16 years 27 days ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
211
click to vote
INFOSCALE
2006
ACM
16 years 25 days ago
2006
ACM
The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Inte...
200
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...