716 search results - page 120 / 144 » Algorithmic Issues in Coding Theory |
108
click to vote
SEMWEB
2010
Springer
15 years 10 days ago
2010
Springer
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
120
click to vote
MICRO
2010
IEEE
15 years 11 days ago
2010
IEEE
A particularly insidious type of concurrency bug is atomicity violations. While there has been substantial work on automatic detection of atomicity violations, each existing techn...
118
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
131
Voted
VISUALIZATION
2000
IEEE
15 years 6 months ago
2000
IEEE
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
147
click to vote
POPL
2012
ACM
13 years 10 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...