Sciweavers

1404 search results - page 199 / 281
» Optimization problems in multiple-interval graphs
Sort
View
APPML
2002
58views more  APPML 2002»
14 years 9 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 9 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
TVCG
2011
136views more  TVCG 2011»
14 years 4 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
CVPR
2008
IEEE
15 years 11 months ago
Enforcing convexity for improved alignment with constrained local models
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
INFOCOM
2007
IEEE
15 years 4 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...