Sciweavers

2988 search results - page 93 / 598
» Experiments with a New Boosting Algorithm
Sort
View
SIGIR
2008
ACM
15 years 4 months ago
A new probabilistic retrieval model based on the dirichlet compound multinomial distribution
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...
Zuobing Xu, Ram Akella
FOCS
2004
IEEE
15 years 8 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
MIDDLEWARE
2007
Springer
15 years 11 months ago
New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
Steven Y. Ko, Ramsés Morales, Indranil Gupt...
ISCI
2010
211views more  ISCI 2010»
15 years 3 months ago
A new heuristic approach for non-convex optimization problems
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
Rosario Toscano, Patrick Lyonnet
GLVLSI
2007
IEEE
167views VLSI» more  GLVLSI 2007»
15 years 11 months ago
A new approach to logic synthesis of multi-output boolean functions on pal-based CPLDS
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
Dariusz Kania