Sciweavers

3946 search results - page 609 / 790
» The computational complexity of choice sets
Sort
View
NAACL
2010
15 years 4 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
SPIN
2010
Springer
15 years 4 months ago
Efficient Explicit-State Model Checking on General Purpose Graphics Processors
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU). In contrast to existing approaches en...
Stefan Edelkamp, Damian Sulewski
WEBI
2010
Springer
15 years 4 months ago
Exploiting Puzzle Diversity in Puzzle Selection for ESP-Like GWAP Systems
The ESP game belongs to the genre called Games with a Purpose (GWAP), which leverage people's desire to be entertained and also outsource certain steps of the computational p...
Yu-Song Syu, Hsiao-Hsuan Yu, Ling-Jyh Chen
GI
2009
Springer
15 years 4 months ago
A web service based approach for integrating statistics tools into an information system for experiment data
: Data management in the life sciences has evolved from simple storage of data to complex information systems providing additional functionalities like analysis and visualization c...
Dennis Heimann, Jens Nieschulze, Birgitta Kön...
GI
2009
Springer
15 years 4 months ago
A Static Analysis Technique to Detect Unsatisfiable Conditions in Ontology-based Workflows
: Static analysis techniques for consistency checking of workflows allow to avoid runtime errors. This is in particular crucial for long running workflows where errors, detected la...
Gabriele Weiler, Arnd Poetzsch-Heffter, Stephan Ki...