Sciweavers

1003 search results - page 116 / 201
» How to Parallelize Sequential Processes
Sort
View
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 9 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
TOPLAS
1998
133views more  TOPLAS 1998»
13 years 8 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
EUROPAR
2009
Springer
14 years 3 months ago
High Performance Matrix Multiplication on Many Cores
Moore’s Law suggests that the number of processing cores on a single chip increases exponentially. The future performance increases will be mainly extracted from thread-level par...
Nan Yuan, Yongbin Zhou, Guangming Tan, Junchao Zha...
PAMI
2010
140views more  PAMI 2010»
13 years 7 months ago
Differential Geometric Inference in Surface Stereo
—Many traditional two-view stereo algorithms explicitly or implicitly use the frontal parallel plane assumption when exploiting contextual information since, e.g., the smoothness...
Gang Li, Steven W. Zucker
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
14 years 3 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt