Sciweavers

485 search results - page 76 / 97
» Weighted Factorization
Sort
View
ICTAI
1999
IEEE
14 years 7 days ago
A New Study on Using HTML Structures to Improve Retrieval
Locating useful information effectively from the World Wide Web (WWW) is of wide interest. This paper presents new results on a methodology of using the structures and hyperlinks ...
Michal Cutler, H. Deng, S. Maniccam, Weiyi Meng
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
AUSAI
2008
Springer
13 years 10 months ago
Additive Regression Applied to a Large-Scale Collaborative Filtering Problem
Abstract. The much-publicized Netflix competition has put the spotlight on the application domain of collaborative filtering and has sparked interest in machine learning algorithms...
Eibe Frank, Mark Hall
ASPDAC
2005
ACM
100views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Microarchitecture evaluation with floorplanning and interconnect pipelining
— As microprocessor technology continues to scale into the nanometer regime, recent studies show that interconnect delay will be a limiting factor for performance, and multiple c...
Ashok Jagannathan, Hannah Honghua Yang, Kris Konig...