8298 search results - page 1593 / 1660 » On the Complexity of Numerical Analysis |
SIGMOD
1997
ACM
15 years 2 months ago
1997
ACM
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
STOC
1996
ACM
15 years 2 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
108
click to vote
ZUM
1997
Springer
15 years 2 months ago
1997
Springer
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
116
click to vote
COLT
1993
Springer
15 years 2 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
SIGGRAPH
1993
ACM
15 years 2 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...