Sciweavers

85 search results - page 6 / 17
» On Small Hard Leaf Languages
Sort
View
DCC
2011
IEEE
13 years 4 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
WORDS
2003
IEEE
14 years 3 months ago
Timing Analysis of Optimised Code
Timing analysis is a crucial test for dependable hard real-time systems (DHRTS). The calculation of the worst-case execution time (WCET) is mandatory. As modern compilers are capa...
Raimund Kirner, Peter P. Puschner
ANCS
2008
ACM
13 years 11 months ago
Design of a scalable network programming framework
Nearly all programmable commercial hardware solutions offered for high-speed networking systems are capable of meeting the performance and flexibility requirements of equipment ve...
Ben Wun, Patrick Crowley, Arun Raghunath
SIGMOD
2012
ACM
230views Database» more  SIGMOD 2012»
12 years 7 days ago
Pay-as-you-go data integration for linked data: opportunities, challenges and architectures
Linked Data (LD) provides principles for publishing data that underpin the development of an emerging web of data. LD follows the web in providing low barriers to entry: publisher...
Norman W. Paton, Klitos Christodoulou, Alvaro A. A...
ICFP
2005
ACM
14 years 9 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power