9736 search results - page 66 / 1948 » How Fast Can We Compute Products |
151
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
156
Voted
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
157
Voted
KI
2009
Springer
15 years 11 months ago
2009
Springer
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...
152
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
128
click to vote
BIOCOMP
2007
15 years 6 months ago
2007
— This paper describes graph-based relational, unsupervised learning algorithm to infer node replacement graph grammar and its application to metabolic pathways. We search for fr...