Sciweavers

701 search results - page 74 / 141
» Costs Are Expensive!
Sort
View
ICML
1999
IEEE
15 years 3 months ago
Learning Hierarchical Performance Knowledge by Observation
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
Michael van Lent, John E. Laird
KDD
2000
ACM
211views Data Mining» more  KDD 2000»
15 years 2 months ago
Mining IC test data to optimize VLSI testing
We describe an application of data mining and decision analysis to the problem of die-level functional test in integrated circuit manufacturing. Integrated circuits are fabricated...
Tony Fountain, Thomas G. Dietterich, Bill Sudyka
GEOINFORMATICA
1998
79views more  GEOINFORMATICA 1998»
14 years 11 months ago
Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...
Yun-Wu Huang, Matthew C. Jones, Elke A. Rundenstei...
JCST
2010
147views more  JCST 2010»
14 years 9 months ago
Volumetric Vector-Based Representation for Indirect Illumination Caching
Abstract This paper introduces a caching technique based on a volumetric representation that captures low-frequency indirect illumination. This structure is intended for efficient ...
Romain Pacanowski, Xavier Granier, Christophe Schl...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 6 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled