Sciweavers

1169 search results - page 95 / 234
» Degrees of monotone complexity
Sort
View
108
Voted
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
14 years 11 months ago
Fast resolution of hierarchized inverse kinematics with inequality constraints
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
Adrien Escande, Nicolas Mansard, Pierre-Brice Wieb...
90
Voted
INTERSPEECH
2010
14 years 7 months ago
Autoregressive clustering for HMM speech synthesis
The autoregressive HMM has been shown to provide efficient parameter estimation and high-quality synthesis, but in previous experiments decision trees derived from a non-autoregre...
Matt Shannon, William Byrne
ICASSP
2011
IEEE
14 years 4 months ago
Adaptive MIMO detection algorithm by jointly exploiting the properties of signal and channel
The purpose of this paper is to develop an algorithm achieving the performance of fixed-complexity decoder (FSD) with much lower complexity than FSD. An adaptive expansion strate...
Yuehua Ding, Yide Wang, Jean-Francois Diouris
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 1 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
PODS
2002
ACM
98views Database» more  PODS 2002»
16 years 28 days ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan