Sciweavers

1511 search results - page 189 / 303
» Relational Parametricity for Computational Effects
Sort
View
CPC
2004
98views more  CPC 2004»
15 years 6 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...
CORR
2002
Springer
93views Education» more  CORR 2002»
15 years 6 months ago
Modeling Complex Domains of Actions and Change
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...
Antonis C. Kakas, Loizos Michael
ICCHP
2010
Springer
15 years 4 months ago
An Open Source / Freeware Assistive Technology Software Inventory
Assistive Technology (AT) software market is expensive, and related products are hard to find, especially for non-English speaking users. Open Source and free AT software partially...
Alexandros Pino, Georgios Kouroupetroglou, Hernisa...
TIT
2010
155views Education» more  TIT 2010»
15 years 1 months ago
On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach
In this contribution, the capacity-achieving input covariance matrices for coherent blockfading correlated MIMO Rician channels are determined. In contrast with the Rayleigh and u...
Julien Dumont, Walid Hachem, Samson Lasaulce, Phil...
TNN
2010
176views Management» more  TNN 2010»
15 years 1 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao