Sciweavers

6110 search results - page 55 / 1222
» Approximate Computing
Sort
View
ECCC
2011
234views ECommerce» more  ECCC 2011»
14 years 11 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
ACSC
2006
IEEE
15 years 10 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
DAC
1998
ACM
15 years 9 months ago
Approximate Reachability with BDDs Using Overlapping Projections
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
Shankar G. Govindaraju, David L. Dill, Alan J. Hu,...
TOG
2008
163views more  TOG 2008»
15 years 4 months ago
Imperfect shadow maps for efficient computation of indirect illumination
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...
AMC
2008
99views more  AMC 2008»
15 years 4 months ago
Markov chain network training and conservation law approximations: Linking microscopic and macroscopic models for evolution
In this paper, a general framework for the analysis of a connection between the training of artificial neural networks via the dynamics of Markov chains and the approximation of c...
Roderick V. N. Melnik