Sciweavers

661 search results - page 126 / 133
» Argument Reduction by Factoring
Sort
View
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
13 years 12 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
FOCS
2000
IEEE
13 years 11 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson
HPCA
2000
IEEE
13 years 11 months ago
A Prefetching Technique for Irregular Accesses to Linked Data Structures
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
INFOCOM
2000
IEEE
13 years 11 months ago
Quantifying the Benefit of Configurability in Circuit-Switched WDM Ring Networks
—In a reconfigurable network, lightpath connections can be dynamically changed to reflect changes in traffic conditions. This paper characterizes the gain in traffic capacity tha...
Brett Schein, Eytan Modiano
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
13 years 11 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim