4114 search results - page 187 / 823 » Efficient Algorithms for the 2-Center Problems |
281
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
105
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
155
click to vote
LCN
2007
IEEE
16 years 23 days ago
2007
IEEE
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
172
click to vote
RTSS
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
163
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider optimal allocation of resources to users in a downlink OFDMA system to support heterogeneous applications consisting of both deadline-sensitive (DS) and best-effort (BE...