Sciweavers

1576 search results - page 199 / 316
» Streaming Algorithms for Independent Sets
Sort
View
NIPS
2007
15 years 6 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 4 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 4 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
16 years 5 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
CISS
2008
IEEE
15 years 11 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman