Sciweavers

3221 search results - page 275 / 645
» Termination of Linear Programs
Sort
View
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 11 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 6 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
EWC
2000
106views more  EWC 2000»
15 years 6 months ago
Object Oriented Tools for Scientific Computing
A set of object oriented tools is presented which, when combined, yield an efficient parallel finite element program. Special emphasis is given to details within the concept of the...
Philippe R. B. Devloo
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
15 years 3 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
Haider Fakher Radhi Al-Saidy
POPL
2000
ACM
15 years 10 months ago
Verifying Secrets and Relative Secrecy
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
Dennis M. Volpano, Geoffrey Smith