Sciweavers

2635 search results - page 18 / 527
» Computing multihomogeneous resultants using straight-line pr...
Sort
View
187
Voted
ACMSE
2011
ACM
14 years 11 days ago
Integrating digital logic design and assembly programming using FPGAs in the classroom
Rising Field Programmable Gate Array (FPGA) market volumes combined with increasing industrial popularity have driven prices down and improved capability to the point that FPGA ha...
William M. Jones, D. Brian Larkins
106
Voted
FECS
2006
141views Education» more  FECS 2006»
15 years 1 months ago
Continuous improvement of the Computer Science Undergraduate Program at CSULA
The Department of Computer Science at California State University, Los Angeles has established an assessment process to guide the continuous improvement of the undergraduate curri...
Russ Abbott, Vladimir Akis, Valentino Crespi, Huip...
PPOPP
2012
ACM
13 years 8 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
JGO
2008
83views more  JGO 2008»
15 years 10 days ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Lewis Ntaimo, Matthew W. Tanner
119
Voted
ICALP
2007
Springer
15 years 6 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson