Sciweavers

178 search results - page 25 / 36
» Splitting a CR-Prolog Program
Sort
View
PPOPP
2010
ACM
14 years 5 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
DATE
2003
IEEE
145views Hardware» more  DATE 2003»
14 years 1 months ago
Automated Bus Generation for Multiprocessor SoC Design
The performance of a system, especially a multiprocessor system, heavily depends upon the efficiency of its bus architecture. This paper presents a methodology to generate a custo...
Kyeong Keol Ryu, Vincent John Mooney
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 7 days ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
IPPS
1996
IEEE
14 years 1 days ago
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
This paper presents e cient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter SNF, and an image segmentation technique which ma...
David A. Bader, Joseph JáJá, David H...
INTERNET
2007
113views more  INTERNET 2007»
13 years 7 months ago
REST Eye for the SOA Guy
it’s hardly Earth-shattering: abstracting your business services and separating them from your applications can yield an overall system that’s easier to build, maintain, and ex...
Steve Vinoski