Sciweavers

2654 search results - page 131 / 531
» On Pairing Inversion Problems
Sort
View
139
Voted
CP
2010
Springer
15 years 3 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
ICASSP
2011
IEEE
14 years 8 months ago
Sparse video recovery using Linearly Constrained Gradient Projection
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
Daniel Thompson, Zachary T. Harmany, Roummel F. Ma...
BIRD
2008
Springer
109views Bioinformatics» more  BIRD 2008»
15 years 7 months ago
A Robust Class of Stable Proteins in the 2D HPC Model
The inverse protein folding problem is that of designing an amino acid sequence which has a prescribed native protein fold. This problem arises in drug design where a particular st...
Alireza Hadj Khodabakhshi, Ján Manuch, Aras...
ICS
2010
Tsinghua U.
16 years 2 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
ICDCS
2009
IEEE
16 years 2 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir