Sciweavers

2969 search results - page 192 / 594
» A space efficient algorithm for group structure computation
Sort
View
IOPADS
1996
87views more  IOPADS 1996»
15 years 5 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
IJAR
2006
89views more  IJAR 2006»
15 years 3 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
IJCV
2006
165views more  IJCV 2006»
15 years 3 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache
ECCV
2004
Springer
16 years 5 months ago
Classifying Materials from Their Reflectance Properties
We explore the possibility of recognizing the surface material from a single image with unknown illumination, given the shape of the surface. Model-based PCA is used to create a lo...
Peter Nillius, Jan-Olof Eklundh
SSD
2005
Springer
105views Database» more  SSD 2005»
15 years 9 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis