Sciweavers

1363 search results - page 163 / 273
» The road coloring problem
Sort
View
SCALESPACE
2007
Springer
16 years 13 days ago
Faithful Recovery of Vector Valued Functions from Incomplete Data
On March 11, 1944, the famous Eremitani Church in Padua (Italy) was destroyed in an Allied bombing along with the inestimable frescoes by Andrea Mantegna et al. contained in the Ov...
Massimo Fornasier
WAPCV
2007
Springer
16 years 13 days ago
Modeling the Dynamics of Feature Binding During Object-Selective Attention
We present a biologically plausible computational model for solving the visual feature binding problem. The binding problem appears to be due to the distributed nature of visual pr...
Albert L. Rothenstein, John K. Tsotsos
CVPR
2010
IEEE
16 years 2 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
ISCIS
2009
Springer
16 years 26 days ago
Construction of examination timetables based on ordering heuristics
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
Syariza Abdul Rahman, Andrzej Bargiela, Edmund K. ...
ICDCIT
2007
Springer
16 years 14 days ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...