Sciweavers

7529 search results - page 1369 / 1506
» The Modula-3 Type System
Sort
View
ECOOPW
2000
Springer
15 years 9 months ago
Metadata and Adaptive Object-Models
Abstract. The unrelenting pace of change that confronts contemporary software developers compels them to make their applications more configurable, flexible, and adaptable. A way t...
Joseph W. Yoder, Reza Razavi
VISUALIZATION
1999
IEEE
15 years 9 months ago
Image Graphs - A Novel Approach to Visual Data Exploration
For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a vi...
Kwan-Liu Ma
133
Voted
RANDOM
1998
Springer
15 years 9 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
172
Voted
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 9 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
144
Voted
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 9 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
« Prev « First page 1369 / 1506 Last » Next »