Sciweavers

927 search results - page 88 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
ESA
2007
Springer
99views Algorithms» more  ESA 2007»
16 years 13 days ago
Linear-Time Ranking of Permutations
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
Martin Mares, Milan Straka
CIKM
2004
Springer
15 years 11 months ago
Composable XML integration grammars
The proliferation of XML as a standard for data representation and exchange in diverse, next-generation Web applications has created an emphatic need for effective XML data-integr...
Wenfei Fan, Minos N. Garofalakis, Ming Xiong, Xibe...
IPPS
2006
IEEE
16 years 9 days ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
MICCAI
2007
Springer
16 years 7 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
CGF
2000
127views more  CGF 2000»
15 years 6 months ago
Interactive High-Quality Maximum Intensity Projection
Maximum Intensity Projection (MIP) is a volume rendering technique which is used to visualize high-intensity structures within volumetric data. At each pixel the highest data valu...
Lukas Mroz, Helwig Hauser, Eduard Gröller