Sciweavers

4940 search results - page 262 / 988
» On the Complexity of Universal Programs
Sort
View
VLDB
1991
ACM
179views Database» more  VLDB 1991»
15 years 10 months ago
A Relationship Mechanism for a Strongly Typed Object-Oriented Database Programming Language
Object-oriented data models are receiving wide attention since they provide expressive ionmechanismsto model naturally and directly both structural and behavioral aspectsof comple...
Antonio Albano, Giorgio Ghelli, Renzo Orsini
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 7 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
HICSS
1998
IEEE
120views Biometrics» more  HICSS 1998»
15 years 10 months ago
Designing the Digital Agora: Pushing the Web Envelope
The Digital Agora is an information resource that supports understanding and analysis of complex problems in the social sciences. Large amounts of data are available from many dif...
Carolyn R. Watters, Michael A. Shepherd, Cynthia A...
ASE
2004
137views more  ASE 2004»
15 years 6 months ago
Automatically Restructuring Programs for the Web
The construction of interactive server-side Web applications differs substantially from the construction of traditional interactive programs. In contrast, existing Web programming...
Jacob Matthews, Robert Bruce Findler, Paul T. Grau...
ICFP
2007
ACM
16 years 6 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni