Sciweavers

163 search results - page 1 / 33
» A Parallel Search Engine with BSP
Sort
View
LAWEB
2005
IEEE
13 years 10 months ago
A Parallel Search Engine with BSP
With the technology advance and the growth of Internet, the information that can be found in this net, as well as the number of users that access to look for specific data is big...
Veronica Gil Costa, Mauricio Marín
EUROPAR
2008
Springer
13 years 6 months ago
A Search Engine Index for Multimedia Content
We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study wi...
Mauricio Marín, Veronica Gil Costa, Carolin...
FSTTCS
2004
Springer
13 years 10 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
IPPS
1997
IEEE
13 years 9 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
TPDS
2008
124views more  TPDS 2008»
13 years 4 months ago
Efficient Breadth-First Search on the Cell/BE Processor
Multicore processors are an architectural paradigm shift that promises a dramatic increase in performance. But, they also bring an unprecedented level of complexity in algorithmic ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...