Sciweavers

2100 search results - page 149 / 420
» Fundamentals of the problem
Sort
View
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 7 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
JUCS
2008
150views more  JUCS 2008»
15 years 6 months ago
Optimal Sensor Network Layout Using Multi-Objective Metaheuristics
: Wireless Sensor Networks (WSN) allow, thanks to the use of small wireless devices known as sensor nodes, the monitorization of wide and remote areas with precision and liveness u...
Guillermo Molina, Enrique Alba, El-Ghazali Talbi
JMLR
2010
104views more  JMLR 2010»
15 years 28 days ago
Learnability, Stability and Uniform Convergence
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, K...
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 10 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
201
Voted
FGR
2011
IEEE
271views Biometrics» more  FGR 2011»
14 years 9 months ago
Active conditional models
— Matching images with large geometric and iconic changes (e.g. faces under different poses and facial expressions) is an open research problem in computer vision. There are two ...
Ying Chen, Fernando De la Torre