Sciweavers

1445 search results - page 12 / 289
» Uniformly Hard Languages
Sort
View
ICALP
2003
Springer
14 years 26 days ago
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities
Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Ko...
ECOOP
2008
Springer
13 years 9 months ago
A Uniform Transactional Execution Environment for Java
Abstract. Transactional memory (TM) has recently emerged as an effective tool for extracting fine-grain parallelism from declarative critical sections. In order to make STM systems...
Lukasz Ziarek, Adam Welc, Ali-Reza Adl-Tabatabai, ...
ICFP
2012
ACM
11 years 10 months ago
Nested data-parallelism on the gpu
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
Lars Bergstrom, John H. Reppy
LREC
2010
123views Education» more  LREC 2010»
13 years 9 months ago
Querying Diverse Treebanks in a Uniform Way
This paper presents a system for querying treebanks in a uniform way. The system is able to work with both dependency and constituency based treebanks in any language. We demonstr...
Jan Stepánek, Petr Pajas
ACTA
2007
62views more  ACTA 2007»
13 years 7 months ago
Representation and uniformization of algebraic transductions
Abstract This paper explores different means of representation for algebraic transductions, i.e., word relations realized by pushdown transducers. The relevance of this work lies m...
Stavros Konstantinidis, Nicolae Santean, Sheng Yu