Sciweavers

598 search results - page 38 / 120
» Procedure Based Program Compression
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Element Rearrangement for Tensor-Based Subspace Learning
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
EUROSSC
2007
Springer
14 years 1 months ago
The Design of a Pressure Sensing Floor for Movement-Based Human Computer Interaction
This paper addresses the design of a large area, high resolution, networked pressure sensing floor with primary application in movement-based human-computer interaction (M-HCI). T...
Sankar Rangarajan, Assegid Kidané, Gang Qia...
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
IJON
2008
95views more  IJON 2008»
13 years 7 months ago
A support vector machine with integer parameters
We describe here a method for building a support vector machine (SVM) with integer parameters. Our method is based on a branchand-bound procedure, derived from modern mixed intege...
Davide Anguita, Alessandro Ghio, Stefano Pischiutt...
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 9 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...