Sciweavers

6142 search results - page 130 / 1229
» The Complexity of Partition Functions
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
14 years 8 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
ICML
2006
IEEE
15 years 10 months ago
Learning a kernel function for classification with small training samples
When given a small sample, we show that classification with SVM can be considerably enhanced by using a kernel function learned from the training data prior to discrimination. Thi...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
TVCG
2008
144views more  TVCG 2008»
14 years 10 months ago
Spherical Piecewise Constant Basis Functions for All-Frequency Precomputed Radiance Transfer
This paper presents a novel basis function, called spherical piecewise constant basis function (SPCBF), for precomputed radiance transfer. SPCBFs have several desirable properties:...
Kun Xu, Yun-Tao Jia, Hongbo Fu, Shi-Min Hu, Chiew-...
TVLSI
1998
124views more  TVLSI 1998»
14 years 9 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
ICASSP
2009
IEEE
15 years 4 months ago
Exploring functional connectivity in fMRI via clustering
In this paper we investigate the use of data driven clustering methods for functional connectivity analysis in fMRI. In particular, we consider the K-Means and Spectral Clustering...
Archana Venkataraman, Koene R. A. Van Dijk, Randy ...