Sciweavers

2403 search results - page 210 / 481
» Optimal Randomized RANSAC
Sort
View
137
Voted
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
15 years 3 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
134
Voted
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 4 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
133
Voted
ISBRA
2009
Springer
15 years 10 months ago
Mean Square Residue Biclustering with Missing Data and Row Inversions
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
Stefan Gremalschi, Gulsah Altun, Irina Astrovskaya...
124
Voted
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 3 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
153
Voted
TIT
2010
136views Education» more  TIT 2010»
14 years 10 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra