3600 search results - page 280 / 720 » The settling-time reducibility ordering |
169
click to vote
CHI
1995
ACM
15 years 10 months ago
1995
ACM
Current networked information systems on the Internet, whilst extremely successful, run into problems of fragmentation, consistency, scalability, and loss of orientation. The deve...
168
click to vote
SPIN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
161
click to vote
DEXA
1995
Springer
15 years 10 months ago
1995
Springer
- In order to accomplish independence on the logical data organization, a relational DBMS must be capable of interpreting query language sentences which reference attributes belong...
163
Voted
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
In this paper the programs APPLYSYM, QUASILINPDE and DETRAFO are described which aim at the utilization of infinitesimal symmetries of differential equations. The purpose of QUA...
170
click to vote
MM
1995
ACM
15 years 10 months ago
1995
ACM
As common as video processing is, programmers still implement video programs as manipulations of arrays of pixels. This paper presents a language extension called Rivl (pronounced...