Sciweavers

2593 search results - page 439 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
VAST
2004
ACM
14 years 2 months ago
A Point-Based Approach for Capture, Display and Illustration of Very Complex Archeological Artefacts
In this paper we present a complete point-based pipeline for the capture, display and illustration of very large scans of archeological artifacts. This approach was developed as p...
Florent Duguet, George Drettakis, Daniel Girardeau...
POPL
1993
ACM
14 years 1 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
BMCBI
2010
62views more  BMCBI 2010»
13 years 9 months ago
Forward-time simulation of realistic samples for genome-wide association studies
Background: Forward-time simulations have unique advantages in power and flexibility for the simulation of genetic samples of complex human diseases because they can closely mimic...
Bo Peng, Christopher I. Amos
PC
2006
103views Management» more  PC 2006»
13 years 8 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
BIRTHDAY
2010
Springer
13 years 7 months ago
The Architecture Description Language MoDeL
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
Peter Klein