1866 search results - page 39 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
CG
2002
Springer
13 years 7 months ago
2002
Springer
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We address ranging energy optimization for an unsynchronized localization system, which features robust sensor positioning, in the sense that specific accuracy requirements are f...
SWAT
2010
Springer
14 years 14 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
NIPS
2008
13 years 8 months ago
2008
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...