Sciweavers

225 search results - page 33 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
JMLR
2010
134views more  JMLR 2010»
14 years 11 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
COMPGEOM
2010
ACM
15 years 9 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
CVPR
2005
IEEE
16 years 6 months ago
Hallucinating Faces: TensorPatch Super-Resolution and Coupled Residue Compensation
In this paper, we propose a new face hallucination framework based on image patches, which integrates two novel statistical super-resolution models. Considering that image patches...
Wei Liu, Dahua Lin, Xiaoou Tang
TIT
2010
136views Education» more  TIT 2010»
14 years 11 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
SIGECOM
2005
ACM
106views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
On decentralized incentive compatible mechanisms
Algorithmic Mechanism Design focuses on Dominant Strategy Implementations. The main positive results are the celebrated Vickrey-Clarke-Groves (VCG) mechanisms and computationally ...
Ahuva Mu'alem