Sciweavers

1982 search results - page 338 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
IPPS
2010
IEEE
15 years 10 days ago
On the parallelisation of MCMC by speculative chain execution
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
Jonathan M. R. Byrd, Stephen A. Jarvis, Abhir H. B...
MM
2004
ACM
121views Multimedia» more  MM 2004»
15 years 7 months ago
A framework for robust and scalable audio streaming
We propose a framework to achieve bandwidth efficient, error robust and bitrate scalable audio streaming. Our approach is compatible with most audio compression format. The main c...
Ye Wang, Wendong Huang, Jari Korhonen
147
Voted
EOR
2007
165views more  EOR 2007»
15 years 2 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang
VISUALIZATION
1997
IEEE
15 years 6 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
16 years 3 months ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...