Sciweavers

171 search results - page 18 / 35
» Algorithms for Single-Source Vertex Connectivity
Sort
View
95
Voted
DMTCS
2010
125views Mathematics» more  DMTCS 2010»
14 years 6 months ago
Binary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
Stefan Felsner, Clemens Huemer, Sarah Kappes, Davi...
GLOBECOM
2007
IEEE
15 years 3 months ago
Two Energy-Saving Schemes for Cooperative Transmission with Opportunistic Large Arrays
— An opportunistic large array (OLA) is a form of cooperative diversity in which a large group of simple, inexpensive relays or forwarding nodes operate without any mutual coordi...
Lakshmi V. Thanayankizil, Aravind Kailas, Mary Ann...
99
Voted
JODS
2006
131views Data Mining» more  JODS 2006»
14 years 9 months ago
Integrating and Exchanging XML Data Using Ontologies
While providing a uniform syntax and a semistructured data model, XML does not express semantics but only structure such as nesting information. In this paper, we consider the prob...
Huiyong Xiao, Isabel F. Cruz
63
Voted
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 1 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
ECCV
2006
Springer
15 years 11 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin