Sciweavers

16883 search results - page 3144 / 3377
» Generalized Non-Reducible Descriptors
Sort
View
POPL
1998
ACM
15 years 10 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 10 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
SIGGRAPH
1998
ACM
15 years 10 months ago
Rendering Synthetic Objects into Real Scenes: Bridging Traditional and Image-based Graphics with Global Illumination and High Dy
We present a method that uses measured scene radiance and global illumination in order to add new objects to light-based models with correct lighting. The method uses a high dynam...
Paul E. Debevec
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...
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
15 years 10 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
« Prev « First page 3144 / 3377 Last » Next »