Sciweavers

1461 search results - page 255 / 293
» Complexity of Graph Covering Problems
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
CVPR
2004
IEEE
14 years 10 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
CVPR
2004
IEEE
14 years 10 months ago
Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 10 months ago
Differencing Provenance in Scientific Workflows
Abstract-- Scientific workflow management systems are increaingly providing the ability to manage and query the provenance of data products. However, the problem of differencing th...
Zhuowei Bao, Sarah Cohen Boulakia, Susan B. Davids...
ICDE
2007
IEEE
220views Database» more  ICDE 2007»
14 years 10 months ago
Structural Selectivity Estimation for XML Documents
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
Damien K. Fisher, Sebastian Maneth