Sciweavers

4850 search results - page 564 / 970
» Approximate Data Structures with Applications
Sort
View
IJON
2010
109views more  IJON 2010»
15 years 1 months ago
Variational inference for Student-t MLP models
This paper presents a novel methodology to infer parameters of probabilistic models whose output noise is a Student-t distribution. The method is an extension of earlier work for ...
Hang T. Nguyen, Ian T. Nabney
180
Voted
JMLR
2010
127views more  JMLR 2010»
15 years 1 months ago
Cross-associating unlabelled timbre distributions to create expressive musical mappings
In timbre remapping applications such as concatenative synthesis, an audio signal is used as a template, and a mapping process derives control data for some audio synthesis algori...
Dan Stowell, Mark D. Plumbley
GLOBECOM
2007
IEEE
16 years 1 months ago
A New Design of Bloom Filter for Packet Inspection Speedup
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
Yang Chen, Abhishek Kumar, Jun Xu
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
16 years 1 months ago
Integrating Databases into the Semantic Web through an Ontology-Based Framework
To realize the Semantic Web, it will be necessary to make existing database content available for emerging Semantic Web applications, such as web agents and services, which use on...
Dejing Dou, Paea LePendu, Shiwoong Kim, Peishen Qi
USS
2008
15 years 9 months ago
Practical Symmetric Key Cryptography on Modern Graphics Hardware
Graphics processors are continuing their trend of vastly outperforming CPUs while becoming more general purpose. The latest generation of graphics processors have introduced the a...
Owen Harrison, John Waldron