8695 search results - page 1559 / 1739 » Making the Complex Simple |
144
Voted
CIKM
1993
Springer
15 years 7 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
158
click to vote
COCO
1994
Springer
15 years 7 months ago
1994
Springer
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 ...
141
Voted
SIGMOD
1994
ACM
15 years 7 months ago
1994
ACM
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
185
Voted
UIST
1993
ACM
15 years 7 months ago
1993
ACM
This paper describes the VB2 architecture for the construction of three-dimensional interactive applications. The system's state and behavior are uniformly represented as a n...
120
click to vote
FP
1989
15 years 7 months ago
1989
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...