Sciweavers

1341 search results - page 172 / 269
» Probabilistic Abstraction Hierarchies
Sort
View
CORR
1999
Springer
164views Education» more  CORR 1999»
15 years 10 days ago
Annotation graphs as a framework for multidimensional linguistic data analysis
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
Steven Bird, Mark Liberman
111
Voted
ICSR
2009
Springer
14 years 10 months ago
Reusing Patterns through Design Refinement
Abstract. Refinement concepts, such as procedural and data refinement, are among the most important ideas of software engineering. In this paper, we investigate the idea of design ...
Jason O. Hallstrom, Neelam Soundarajan
145
Voted
IEEEPACT
2009
IEEE
14 years 10 months ago
FASTM: A Log-based Hardware Transactional Memory with Fast Abort Recovery
Abstract--Version management, one of the key design dimensions of Hardware Transactional Memory (HTM) systems, defines where and how transactional modifications are stored. Current...
Marc Lupon, Grigorios Magklis, Antonio Gonzá...
TVCG
2010
165views more  TVCG 2010»
14 years 7 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin
190
Voted
ASPLOS
2011
ACM
14 years 4 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...