Sciweavers

514 search results - page 24 / 103
» Multiplicative structures in additively large sets
Sort
View
EUROPAR
2005
Springer
14 years 1 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
IJON
1998
82views more  IJON 1998»
13 years 7 months ago
Solving arithmetic problems using feed-forward neural networks
We design new feed-forward multi-layered neural networks which perform di erent elementary arithmetic operations, such as bit shifting, addition of N p-bit numbers, and multiplica...
Leonardo Franco, Sergio A. Cannas
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
14 years 8 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
BMCBI
2007
87views more  BMCBI 2007»
13 years 7 months ago
A manually curated database of tetrapod mitochondrially encoded tRNA sequences and secondary structures
Background: Mitochondrial tRNAs have been the subject of study for structural biologists interested in their secondary structure characteristics, evolutionary biologists have rese...
Konstantin Yu Popadin, Leila A. Mamirova, Fyodor A...
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu