Sciweavers

562 search results - page 54 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
CGF
1998
134views more  CGF 1998»
14 years 9 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...
ECAI
2010
Springer
14 years 11 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
IPMI
2005
Springer
15 years 10 months ago
Extrapolation of Sparse Tensor Fields: Application to the Modeling of Brain Variability
Modeling the variability of brain structures is a fundamental problem in the neurosciences. In this paper, we start from a dataset of precisely delineated anatomical structures in ...
Pierre Fillard, Vincent Arsigny, Xavier Pennec, Pa...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 5 days ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
ICFP
2005
ACM
15 years 9 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...