Sciweavers

6110 search results - page 742 / 1222
» Approximate Computing
Sort
View
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 10 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 10 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
VR
2000
IEEE
114views Virtual Reality» more  VR 2000»
15 years 10 months ago
Virtual Fekete Point Configurations: A Case Study in Perturbing Complex Systems
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
Robert van Liere, Jurriaan D. Mulder, Jason Frank,...
ISLPED
1995
ACM
80views Hardware» more  ISLPED 1995»
15 years 10 months ago
Techniques for fast circuit simulation applied to power estimation of CMOS circuits
We present a transistor level power estimator which exploits algorithms for fast circuit simulation to compute the power dissipation of CMOS circuits. The proposed approach uses s...
Premal Buch, Shen Lin, Vijay Nagasamy, Ernest S. K...
ICCD
1991
IEEE
65views Hardware» more  ICCD 1991»
15 years 10 months ago
Self-Timed Logic Using Current-Sensing Completion Detection (CSCD)
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
Mark E. Dean, David L. Dill, Mark Horowitz