Sciweavers

4894 search results - page 629 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 4 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
MONET
2006
103views more  MONET 2006»
15 years 4 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 4 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
COMPUTER
1999
69views more  COMPUTER 1999»
15 years 3 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
MP
2007
145views more  MP 2007»
15 years 3 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz