Sciweavers

5214 search results - page 77 / 1043
» The Online Specialization Problem
Sort
View
MP
2006
121views more  MP 2006»
13 years 7 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
MOC
2002
81views more  MOC 2002»
13 years 7 months ago
Optimal a priori error estimates for the hp-version of the local discontinuous Galerkin method for convection--diffusion problem
We study the convergence properties of the hp-version of the local discontinuous Galerkin finite element method for convection-diffusion problems; we consider a model problem in a ...
Paul Castillo, Bernardo Cockburn, Dominik Schö...
WG
2001
Springer
14 years 4 days ago
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
Sergei L. Bezrukov, Robert Elsässer
MOC
2000
76views more  MOC 2000»
13 years 7 months ago
The convergence of the cascadic conjugate-gradient method applied to elliptic problems in domains with re-entrant corners
Abstract. We study the convergence properties of the cascadic conjugategradient method (CCG-method), which can be considered as a multilevel method without coarse-grid correction. ...
Vladimir Shaidurov, Lutz Tobiska
HIP
2005
Springer
168views Cryptology» more  HIP 2005»
14 years 1 months ago
Leveraging the CAPTCHA Problem
Efforts to defend against automated attacks on e-commerce services have led to a new security protocol known as a CAPTCHA, a challenge designed to exploit gaps in the perceptual a...
Daniel P. Lopresti