Sciweavers

249 search results - page 45 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 9 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
BMCBI
2006
129views more  BMCBI 2006»
13 years 7 months ago
BIPAD: A web server for modeling bipartite sequence elements
Background: Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences sepa...
Chengpeng Bi, Peter K. Rogan
BMCBI
2006
153views more  BMCBI 2006»
13 years 7 months ago
Discovery of time-delayed gene regulatory networks based on temporal gene expression profiling
Background: It is one of the ultimate goals for modern biological research to fully elucidate the intricate interplays and the regulations of the molecular determinants that prope...
Xia Li, Shaoqi Rao, Wei Jiang, Chuanxing Li, Yun X...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie