Sciweavers

3019 search results - page 268 / 604
» Approximating the Domatic Number
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Efficient co-regularised least squares regression
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
Stefan Wrobel, Thomas Gärtner, Tobias Scheffe...
STOC
2010
ACM
618views Algorithms» more  STOC 2010»
16 years 3 months ago
Differential Privacy Under Continual Observation
We ask the question ? how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user's privacy? We propose a differ...
Cynthia Dwork, Moni Naor, Toniann Pitassi and Guy ...
GLOBECOM
2009
IEEE
16 years 1 months ago
How Bad is Single-Path Routing
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...
Meng Wang, Chee Wei Tan, Ao Tang, Steven H. Low
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
16 years 1 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
EMO
2009
Springer
174views Optimization» more  EMO 2009»
16 years 1 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck