Sciweavers

19798 search results - page 639 / 3960
» Is Structural Subtyping Useful
Sort
View
ER
1998
Springer
100views Database» more  ER 1998»
15 years 10 months ago
Designing Well-Structured Websites: Lessons to Be Learned from Database Schema Methodology
Abstract. In this paper we argue that many of the problems one may experience while visiting websites today may be avoided if their builders adopt a proper methodology for designin...
Olga De Troyer
ASPLOS
1996
ACM
15 years 10 months ago
The Structure and Performance of Interpreters
Interpreted languages have become increasingly popular due to demands for rapid program development, ease of use, portability, and safety. Beyond the general impression that they ...
Theodore H. Romer, Dennis Lee, Geoffrey M. Voelker...
DAC
1996
ACM
15 years 10 months ago
Structural Gate Decomposition for Depth-Optimal Technology Mapping in LUT-based FPGA Design
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
Jason Cong, Yean-Yow Hwang
CIAC
2010
Springer
234views Algorithms» more  CIAC 2010»
15 years 10 months ago
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bingbing Zhuang and Hiroshi Nagamochi
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 10 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang