Sciweavers

140 search results - page 11 / 28
» Some new results for optimal ternary linear codes
Sort
View
CORR
2006
Springer
98views Education» more  CORR 2006»
14 years 9 months ago
Enabling user-driven Checkpointing strategies in Reverse-mode Automatic Differentiation
This paper presents a new functionality of the Automatic Differentiation (AD) Tool tapenade. tapenade generates adjoint codes which are widely used for optimization or inverse prob...
Laurent Hascoët, Mauricio Araya-Polo
87
Voted
ICALP
2005
Springer
15 years 3 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf
85
Voted
CVPR
2010
IEEE
14 years 8 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
15 years 1 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
83
Voted
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
15 years 2 months ago
A constant-factor approximately optimal solution to the Witsenhausen counterexample
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
Se Yong Park, Pulkit Grover, Anant Sahai