Sciweavers

3875 search results - page 725 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
PG
2007
IEEE
15 years 4 months ago
Automatic Natural Video Matting with Depth
Video matting is the process of taking a sequence of frames, isolating the foreground, and replacing the background with something different in each frame. This is an under-constr...
Oliver Wang, Jonathan Finger, Qingxiong Yang, Jame...
QEST
2007
IEEE
15 years 4 months ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
ROBOCOMM
2007
IEEE
15 years 4 months ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
ADC
2007
Springer
145views Database» more  ADC 2007»
15 years 3 months ago
Selectivity Estimation by Batch-Query based Histogram and Parametric Method
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
Jizhou Luo, Xiaofang Zhou, Yu Zhang, Heng Tao Shen...
COCOON
2007
Springer
15 years 3 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav