Sciweavers

835 search results - page 154 / 167
» On optimal slicing of parallel programs
Sort
View
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
AIPR
2008
IEEE
13 years 9 months ago
Low-cost, high-speed computer vision using NVIDIA's CUDA architecture
In this paper, we introduce real time image processing techniques using modern programmable Graphic Processing Units (GPU). GPUs are SIMD (Single Instruction, Multiple Data) device...
Seung In Park, Sean P. Ponce, Jing Huang, Yong Cao...
ACL
2008
13 years 9 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...
IOPADS
1997
94views more  IOPADS 1997»
13 years 9 months ago
Remote I/O Fast Access to Distant Storage
As high-speed networks make it easier to use distributed resources, it becomes increasingly common that applications and their data are not colocated. Users have traditionally add...
Ian T. Foster, David Kohr, Rakesh Krishnaiyer, Jac...
JGTOOLS
2006
199views more  JGTOOLS 2006»
13 years 7 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman