6568 search results - page 244 / 1314 » Reducing the Complexity of Reductions |
167
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
182
Voted
BMCBI
2008
15 years 6 months ago
2008
Background: The combination of gene expression profiling with linkage analysis has become a powerful paradigm for mapping gene expression quantitative trait loci (eQTL). To date, ...
216
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
168
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper, we propose a novel on-chip voltage drop reduction technique for on-chip power delivery networks of VLSI systems in the presence of variational leakage current sourc...
155
click to vote
ESORICS
2008
Springer
15 years 8 months ago
2008
Springer
The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different ...