Sciweavers

17541 search results - page 3157 / 3509
» Complexity in scalable computing
Sort
View
IPM
2000
142views more  IPM 2000»
15 years 6 months ago
Adapting a diagnostic problem-solving model to information retrieval
In this paper, a competition-based connectionist model for diagnostic problem-solving is adapted to information retrieval. In this model, we treat documents as \disorders" an...
Inien Syu, Sheau-Dong Lang
IR
2000
15 years 6 months ago
Automating the Construction of Internet Portals with Machine Learning
Domain-specific internet portals are growing in popularity because they gather content from the Web and organize it for easy access, retrieval and search. For example, www.campsear...
Andrew McCallum, Kamal Nigam, Jason Rennie, Kristi...
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
« Prev « First page 3157 / 3509 Last » Next »