Sciweavers

183 search results - page 14 / 37
» Geometric Optimization Problems Over Sliding Windows
Sort
View
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
2007
IEEE
167views Database» more  ICDE 2007»
14 years 2 months ago
Load Shedding for Window Joins on Multiple Data Streams
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
Yan-Nei Law, Carlo Zaniolo
ICPR
2006
IEEE
14 years 9 months ago
A novel SVM Geometric Algorithm based on Reduced Convex Hulls
Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of atte...
Michael E. Mavroforakis, Margaritis Sdralis, Sergi...
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
CP
2010
Springer
13 years 7 months ago
Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
Russell Bent, Pascal Van Hentenryck