Sciweavers

933 search results - page 75 / 187
» Monotone Complexity of a Pair
Sort
View
ORL
2000
77views more  ORL 2000»
13 years 8 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Structure-Aware Stochastic Control for Transmission Scheduling
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
Fangwen Fu, Mihaela van der Schaar
ICDM
2010
IEEE
150views Data Mining» more  ICDM 2010»
13 years 6 months ago
Probabilistic Inference Protection on Anonymized Data
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Y...
DLOG
2009
13 years 6 months ago
Reasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attent...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...
CVPR
2001
IEEE
14 years 11 months ago
Semi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler