Sciweavers

7289 search results - page 43 / 1458
» A Dependent Set Theory
Sort
View
RSA
2011
102views more  RSA 2011»
13 years 2 months ago
Dependent random choice
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
Jacob Fox, Benny Sudakov
TIT
2010
174views Education» more  TIT 2010»
13 years 2 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
ADBIS
2007
Springer
127views Database» more  ADBIS 2007»
14 years 2 months ago
Approximate Functional Dependencies for XML Data
Functional dependencies (FDs) are an integral part of database theory since they are used in integrity enforcement and in database design. Recently, functional dependencies satis...
Fabio Fassetti, Bettina Fazzinga
FOSSACS
2010
Springer
14 years 2 months ago
Parameterised Multiparty Session Types
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
Nobuko Yoshida, Pierre-Malo Deniélou, Andi ...
FM
2006
Springer
97views Formal Methods» more  FM 2006»
13 years 11 months ago
Dynamic Frames: Support for Framing, Dependencies and Sharing Without Restrictions
This paper addresses the frame problem for programming theories that support both sharing and encapsulation through specification variables. The concept of dynamic frames is introd...
Ioannis T. Kassios