Sciweavers

1022 search results - page 195 / 205
» Logspace Complexity of Functions and Structures
Sort
View
SIGGRAPH
2000
ACM
14 years 13 hour ago
Adaptively sampled distance fields: a general representation of shape for computer graphics
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
Sarah F. Frisken Gibson, Ronald N. Perry, Alyn P. ...
SIGSOFT
2000
ACM
14 years 12 hour ago
Implicit context: easing software evolution and reuse
Software systems should consist of simple, conceptually clean software components interacting along narrow, well-defined paths. All too often, this is not reality: complex compon...
Robert J. Walker, Gail C. Murphy
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
13 years 12 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
ICCV
1999
IEEE
13 years 12 months ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...
TPHOL
1999
IEEE
13 years 12 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme