Sciweavers

2681 search results - page 65 / 537
» Problem F
Sort
View
SIAMNUM
2010
95views more  SIAMNUM 2010»
14 years 10 months ago
Robust BDDC Preconditioners for Reissner-Mindlin Plate Bending Problems and MITC Elements
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
L. Beirão da Veiga, C. Chinosi, Carlo Lovad...
152
Voted
MFCS
2005
Springer
15 years 9 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
16 years 4 months ago
Private approximation of NP-hard functions
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz,...
CISS
2007
IEEE
15 years 10 months ago
Precoder Optimization for Nonlinear MIMO Transceiver Based on Arbitrary Cost Function
— Assuming full channel state information (CSI) at both transmitter (CSIT) and receiver (CSIR), we consider optimizing a nonlinear MIMO transceiver with (nonlinear) decision feed...
Yi Jiang, Daniel Pérez Palomar, Mahesh K. V...
ANTS
2004
Springer
111views Algorithms» more  ANTS 2004»
15 years 9 months ago
A Method to Solve Cyclotomic Norm Equations
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
Nick Howgrave-Graham, Michael Szydlo