Sciweavers

1068 search results - page 103 / 214
» Factorization as a Rank 1 Problem
Sort
View
CCA
2009
Springer
15 years 4 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
SIAMJO
2010
100views more  SIAMJO 2010»
14 years 4 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
15 years 10 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
JDA
2011
90views more  JDA 2011»
14 years 4 months ago
Pattern matching in pseudo real-time
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
Raphaël Clifford, Benjamin Sach
FOCS
2006
IEEE
15 years 4 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...