Sciweavers

19010 search results - page 3603 / 3802
» Adaptive A
Sort
View
CADE
1998
Springer
15 years 10 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré
176
Voted
SIGCOMM
1998
ACM
15 years 10 months ago
QoSMIC: Quality of Service Sensitive Multicast Internet Protocol
In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such...
Michalis Faloutsos, Anindo Banerjea, Rajesh Pankaj
183
Voted
SIGGRAPH
1998
ACM
15 years 10 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
194
Voted
SIGGRAPH
1998
ACM
15 years 10 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
15 years 10 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
« Prev « First page 3603 / 3802 Last » Next »