Sciweavers

1999 search results - page 94 / 400
» Finding Reductions Automatically
Sort
View
CGF
2004
158views more  CGF 2004»
14 years 9 months ago
Combined Correlated and Importance Sampling in Direct Light Source Computation and Environment Mapping
This paper presents a general variance reduction method that is a quasi-optimal combination of correlated and importance sampling. The weights of the combination are selected auto...
László Szécsi, Mateu Sbert, L...
TSMC
2008
105views more  TSMC 2008»
14 years 9 months ago
Gene Identification: Classical and Computational Intelligence Approaches
: Automatic identification of genes has been an actively researched area of Bioinformatics. Compared to earlier attempts for finding genes, the recent techniques are significantly ...
Sanghamitra Bandyopadhyay, Ujjwal Maulik, D. Roy
STOC
2006
ACM
107views Algorithms» more  STOC 2006»
15 years 10 months ago
On basing one-way functions on NP-hardness
We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana...
NIPS
1998
14 years 11 months ago
Restructuring Sparse High Dimensional Data for Effective Retrieval
The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, docu...
Charles Lee Isbell Jr., Paul A. Viola
ISPD
2009
ACM
79views Hardware» more  ISPD 2009»
15 years 4 months ago
A routing approach to reduce glitches in low power FPGAs
Glitches (spurious transitions) are common in electronic circuits. In this paper we present a novel approach to reduce dynamic power in FPGAs by reducing glitches during the routi...
Quang Dinh, Deming Chen, Martin D. F. Wong