Sciweavers

9532 search results - page 396 / 1907
» Logic, Graphs, and Algorithms
Sort
View
CVPR
2003
IEEE
16 years 8 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
FORTE
2004
15 years 8 months ago
Towards Design Recovery from Observations
This paper proposes an algorithm for the construction of an MSC graph from a given set of actual behaviors of an existing concurrent system which has repetitive subfunctions. Such ...
Hasan Ural, Hüsnü Yenigün
APPML
2010
86views more  APPML 2010»
15 years 7 months ago
A note on single-linkage equivalence
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu
INFOCOM
2000
IEEE
15 years 11 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
ISCC
2002
IEEE
15 years 11 months ago
Survivable routing in WDM networks
—In this paper we consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains ...
Arunabha Sen, Bin Hao, Bao Hong Shen