534 search results - page 42 / 107 » Tight approximation algorithm for connectivity augmentation ... |
126
click to vote
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
109
click to vote
CJ
2010
15 years 2 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
127
click to vote
ECCC
2008
15 years 2 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
110
Voted
JCSS
2008
15 years 2 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
107
Voted
JAT
2010
15 years 23 days ago
2010
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...