2635 search results - page 383 / 527 » Computing multihomogeneous resultants using straight-line pr... |
JCSS
2000
13 years 8 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
IEEEARES
2009
IEEE
14 years 3 months ago
2009
IEEE
— Researchers and practitioners in computer forensics currently must base their analysis on information that is either incomplete or produced by tools that may themselves be comp...
HPCC
2007
Springer
14 years 3 months ago
2007
Springer
One of the outcomes of DARPA’s HPCS program has been the creation of three new high productivity languages: Chapel, Fortress, and X10. While these languages have introduced impro...
HPCA
2008
IEEE
14 years 9 months ago
2008
IEEE
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...