Sciweavers

11909 search results - page 2328 / 2382
» The Scheme Programming Language
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 8 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
TMI
2002
191views more  TMI 2002»
13 years 8 months ago
Automatic Detection of Abnormalities in Chest Radiographs Using Local Texture Analysis
A fully automatic method is presented to detect abnormalities in frontal chest radiographs which are aggregated into an overall abnormality score. The method is aimed at finding ab...
Bram van Ginneken, Shigehiko Katsuragawa, Bart M. ...
MST
2007
167views more  MST 2007»
13 years 8 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
PC
2007
343views Management» more  PC 2007»
13 years 8 months ago
Runtime scheduling of dynamic parallelism on accelerator-based multi-core systems
We explore runtime mechanisms and policies for scheduling dynamic multi-grain parallelism on heterogeneous multi-core processors. Heterogeneous multi-core processors integrate con...
Filip Blagojevic, Dimitrios S. Nikolopoulos, Alexa...
LATIN
2010
Springer
13 years 7 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
« Prev « First page 2328 / 2382 Last » Next »