Sciweavers

34 search results - page 5 / 7
» Implicit Factoring: On Polynomial Time Factoring Given Only ...
Sort
View
UIST
2009
ACM
14 years 1 months ago
Relaxed selection techniques for querying time-series graphs
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
Christian Holz, Steven Feiner
FOCS
2007
IEEE
14 years 1 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 9 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
SIAMSC
2008
140views more  SIAMSC 2008»
13 years 7 months ago
Newton-GMRES Preconditioning for Discontinuous Galerkin Discretizations of the Navier--Stokes Equations
We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier-Stokes equations. The spatial discreti...
Per-Olof Persson, Jaime Peraire
BMCBI
2007
169views more  BMCBI 2007»
13 years 7 months ago
Transcriptional regulatory network refinement and quantification through kinetic modeling, gene expression microarray data and i
Background: Gene expression microarray and other multiplex data hold promise for addressing the challenges of cellular complexity, refined diagnoses and the discovery of well-targ...
Abdallah Sayyed-Ahmad, Kagan Tuncay, Peter J. Orto...