Sciweavers

1686 search results - page 194 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ESWS
2010
Springer
15 years 7 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani
125
Voted
C5
2008
IEEE
15 years 10 months ago
Toward A More Scalable End-User Scripting Language
End-user scripting languages are relatively easy to learn, but have limited expressive power. Tile-based scripting systems are particularly accessible to beginners, but usually ar...
Alessandro Warth, Takashi Yamamiya, Yoshiki Ohshim...
BMCBI
2010
126views more  BMCBI 2010»
15 years 4 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh
146
Voted
IPPS
2010
IEEE
15 years 1 months ago
Towards dynamic reconfigurable load-balancing for hybrid desktop platforms
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
Alécio Pedro Delazari Binotto, Carlos Eduar...
267
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 4 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup