Sciweavers

6142 search results - page 322 / 1229
» The Complexity of Partition Functions
Sort
View
MICCAI
2009
Springer
16 years 7 months ago
A Riemannian Framework for Orientation Distribution Function Computing
Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Functi...
Jian Cheng, Aurobrata Ghosh, Tianzi Jiang, Rachid ...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 7 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ICFP
2005
ACM
16 years 6 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,...
IJCAI
1989
15 years 7 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran