Sciweavers

14386 search results - page 129 / 2878
» The Chinese Generals Problem
Sort
View
111
Voted
HOTOS
1999
IEEE
15 years 7 months ago
Soft Real Time Scheduling for General Purpose Client-Server Systems
This paper considers the problem of scheduling Real Time applications on a general-purpose Operating System. The approach taken is to modify a mainstream system, in order to reali...
David Ingram
108
Voted
TALG
2008
86views more  TALG 2008»
15 years 3 months ago
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
Shuchi Chawla, Anupam Gupta, Harald Räcke
101
Voted
TIT
2002
94views more  TIT 2002»
15 years 3 months ago
A generalized uncertainty principle and sparse representation in pairs of bases
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...
Michael Elad, Alfred M. Bruckstein
113
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 10 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
ICML
2004
IEEE
16 years 4 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye