Sciweavers

2657 search results - page 496 / 532
» On the complexity of hierarchical problem solving
Sort
View
TPHOL
1999
IEEE
14 years 1 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
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 1 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
SAIG
2000
Springer
14 years 23 days ago
On Jones-Optimal Specialization for Strongly Typed Languages
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
Henning Makholm
SIGGRAPH
1997
ACM
14 years 22 days ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...
NIPS
2008
13 years 10 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....