2016 search results - page 48 / 404 » Megamaps: Construction and Examples |
129
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
121
click to vote
SASP
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper we present a method for construction of application specific processor cores from a given C code. Our approach consists of three phases. We start by quantifying t...
165
click to vote
MODELS
2009
Springer
15 years 9 months ago
2009
Springer
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
181
click to vote
ASIACRYPT
2011
Springer
14 years 4 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
150
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Most previous schema mapping works focus on creating mappings in specific data models for data transformation, failing to capture a richer set of possible relationships between sc...