Sciweavers

539 search results - page 39 / 108
» Recurrence relations and fast algorithms
Sort
View
106
Voted
TOG
2002
129views more  TOG 2002»
15 years 2 days ago
Fast bilateral filtering for the display of high-dynamic-range images
We present a new technique for the display of high-dynamic-range images, which reduces the contrast while preserving detail. It is based on a two-scale decomposition of the image ...
Frédo Durand, Julie Dorsey
117
Voted
ICCSA
2004
Springer
15 years 5 months ago
Packing: Scheduling, Embedding, and Approximating Metrics
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
Hu Zhang
226
Voted
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
16 years 2 months ago
Discovering Conditional Functional Dependencies
This paper investigates the discovery of conditional functional dependencies (CFDs). CFDs are a recent extension of functional dependencies (FDs) by supporting patterns of semantic...
Wenfei Fan, Floris Geerts, Laks V. S. Lakshmanan, ...
80
Voted
IACR
2011
134views more  IACR 2011»
14 years 2 days ago
Efficient Implementation of Grand Cru with TI C6x+ Processor
Grand Cru, a candidate cipher algorithm of NESSIE project, is based on the strategy of multiple layered security and derived from AES-128. This algorithm was not selected for secon...
Azhar Ali Khan, Ghulam Murtaza
ICML
2003
IEEE
16 years 1 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...