Sciweavers

16666 search results - page 2973 / 3334
» Descriptive and Computational Complexity
Sort
View
CSDA
2007
152views more  CSDA 2007»
15 years 6 months ago
Robust variable selection using least angle regression and elemental set sampling
In this paper we address the problem of selecting variables or features in a regression model in the presence of both additive (vertical) and leverage outliers. Since variable sel...
Lauren McCann, Roy E. Welsch
EOR
2002
74views more  EOR 2002»
15 years 6 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
JAIR
2000
105views more  JAIR 2000»
15 years 6 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
JCSS
2000
116views more  JCSS 2000»
15 years 6 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
« Prev « First page 2973 / 3334 Last » Next »