Sciweavers

424 search results - page 10 / 85
» Realizability models and implicit complexity
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
TLCA
2009
Springer
14 years 2 months ago
On the Values of Reducibility Candidates
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
Colin Riba
EOR
2007
101views more  EOR 2007»
13 years 7 months ago
Comprehensible credit scoring models using rule extraction from support vector machines
In recent years, Support Vector Machines (SVMs) were successfully applied to a wide range of applications. Their good performance is achieved by an implicit non-linear transformat...
David Martens, Bart Baesens, Tony Van Gestel, Jan ...
ICASSP
2011
IEEE
12 years 11 months ago
Investigation of acoustic units for LVCSR systems
One important issue in designing state-of-the-art LVCSR systems is the choice of acoustic units. Context dependent (CD) phones remain the dominant form of acoustic units. They can...
Xunying Liu, Mark John Francis Gales, Jim L. Hiero...
ICCV
2009
IEEE
13 years 5 months ago
Complex volume and pose tracking with probabilistic dynamical models and visual hull constraints
We propose a method for estimating the pose of a human body using its approximate 3D volume (visual hull) obtained in real time from synchronized videos. Our method can cope with ...
Norimichi Ukita, Michiro Hirai, Masatsugu Kidode