Sciweavers

3267 search results - page 277 / 654
» Generalized quasirandom graphs
Sort
View
ICALP
2009
Springer
16 years 7 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
16 years 1 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
CVPR
2007
IEEE
16 years 1 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
GLOBECOM
2007
IEEE
16 years 1 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
MICCAI
2001
Springer
15 years 11 months ago
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
Yuri Boykov, Vivian S. Lee, Henry Rusinek, Ravi Ba...