Sciweavers

360 search results - page 63 / 72
» The Origins of the Translator's Workstation
Sort
View
NETWORKS
2011
12 years 10 months ago
On terminal delta-wye reducibility of planar graphs
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Isidoro Gitler, Feliu Sagols
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 8 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
PODS
2007
ACM
142views Database» more  PODS 2007»
14 years 7 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
EDBT
2008
ACM
112views Database» more  EDBT 2008»
14 years 7 months ago
Ownership protection of shape datasets with geodesic distance preservation
Protection of one's intellectual property is a topic with important technological and legal facets. The significance of this issue is amplified nowadays due to the ease of da...
Michail Vlachos, Claudio Lucchese, Deepak Rajan, P...
ISCA
1999
IEEE
105views Hardware» more  ISCA 1999»
14 years 1 hour ago
The Program Decision Logic Approach to Predicated Execution
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
David I. August, John W. Sias, Jean-Michel Puiatti...