Sciweavers

2060 search results - page 19 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
ESSMAC
2003
Springer
15 years 2 months ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...
TIT
2008
107views more  TIT 2008»
14 years 9 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
ECCV
2002
Springer
15 years 11 months ago
Revisiting Single-View Shape Tensors: Theory and Applications
Abstract. Given the projection of a su cient numberof points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates...
Anat Levin, Amnon Shashua
67
Voted
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
15 years 10 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
77
Voted
IPPS
2009
IEEE
15 years 4 months ago
Dynamic high-level scripting in parallel applications
Parallel applications typically run in batch mode, sometimes after long waits in a scheduler queue. In some situations, it would be desirable to interactively add new functionalit...
Filippo Gioachin, Laxmikant V. Kalé