Sciweavers

2194 search results - page 52 / 439
» Improving HLRTA*( k )
Sort
View
IASSE
2004
14 years 12 days ago
A Model for Multi-relational Data Mining on Demand Forecasting
Accurate demand forecasting remains difficult and challenging in today's competitive and dynamic business environment, but even a little improvement in demand prediction may ...
Qin Ding, Bhavin Parikh
COLT
2007
Springer
14 years 3 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
14 years 2 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
14 years 13 days ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
JGT
2007
87views more  JGT 2007»
13 years 11 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...