Sciweavers

6045 search results - page 264 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TIT
2002
62views more  TIT 2002»
15 years 6 months ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
COR
2008
102views more  COR 2008»
15 years 6 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
ORL
2007
97views more  ORL 2007»
15 years 6 months ago
Analysis on the forward market equilibrium model
We establish the existence results for the Allaz–Vila [B. Allaz, J.-L. Vila, Cournot competition, forward markets and efficiency, J. Econ. Theory 59 (1993) 1–16] forward mark...
Che-Lin Su
TOMS
2008
80views more  TOMS 2008»
15 years 6 months ago
Updating an LU Factorization with Pivoting
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Enrique S. Quintana-Ortí, Robert A. van de ...
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
15 years 5 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...