Sciweavers

2564 search results - page 101 / 513
» Witness sets of projections
Sort
View
APAL
2010
98views more  APAL 2010»
13 years 9 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes
JSYML
2008
74views more  JSYML 2008»
13 years 9 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
ENTCS
2007
100views more  ENTCS 2007»
13 years 9 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
INFOCOM
2010
IEEE
13 years 7 months ago
UUSee: Large-Scale Operational On-Demand Streaming with Random Network Coding
—Since the inception of network coding in information theory, we have witnessed a sharp increase of research interest in its applications in communications and networking, where ...
Zimu Liu, Chuan Wu, Baochun Li, Shuqiao Zhao
VLSISP
2010
117views more  VLSISP 2010»
13 years 7 months ago
Video Streaming with Network Coding
Recent years have witnessed an explosive growth in multimedia streaming applications over the Internet. Notably, Content Delivery Networks (CDN) and Peer-to-Peer (P2P) networks ha...
Kien Nguyen, Thinh Nguyen, Sen-Ching S. Cheung