Sciweavers

1558 search results - page 165 / 312
» Scalable work stealing
Sort
View
ICFP
2010
ACM
15 years 9 days ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
BMCBI
2008
173views more  BMCBI 2008»
14 years 11 months ago
Extraction of semantic biomedical relations from text using conditional random fields
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...
Markus Bundschus, Mathäus Dejori, Martin Stet...
CVPR
2007
IEEE
16 years 1 months ago
Object retrieval with large vocabularies and fast spatial matching
In this paper, we present a large-scale object retrieval system. The user supplies a query object by selecting a region of a query image, and the system returns a ranked list of i...
James Philbin, Ondrej Chum, Michael Isard, Josef S...
GIS
2007
ACM
16 years 9 days ago
TerraStream: from elevation data to watershed hierarchies
We consider the problem of extracting a river network and a watershed hierarchy from a terrain given as a set of irregularly spaced points. We describe TerraStream, a "pipeli...
Andrew Danner, Thomas Mølhave, Ke Yi, Panka...
PPOPP
2009
ACM
15 years 11 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader