Sciweavers

4781 search results - page 816 / 957
» Online algorithms for network design
Sort
View
SPAA
1997
ACM
15 years 10 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
ICALP
1993
Springer
15 years 10 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
TSMC
1998
91views more  TSMC 1998»
15 years 6 months ago
Toward the border between neural and Markovian paradigms
— A new tendency in the design of modern signal processing methods is the creation of hybrid algorithms. This paper gives an overview of different signal processing algorithms si...
Piotr Wilinski, Basel Solaiman, A. Hillion, W. Cza...
ICASSP
2009
IEEE
16 years 1 months ago
Scalable distributed source coding
This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
Ankur Saxena, Kenneth Rose
PVLDB
2010
117views more  PVLDB 2010»
15 years 4 months ago
Distance-Based Outlier Detection: Consolidation and Renewed Bearing
Detecting outliers in data is an important problem with interesting applications in a myriad of domains ranging from data cleaning to financial fraud detection and from network i...
Gustavo Henrique Orair, Carlos Teixeira, Ye Wang, ...