Sciweavers

1736 search results - page 308 / 348
» The rank-width of Directed Graphs
Sort
View
COR
2007
108views more  COR 2007»
15 years 17 days ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
93
Voted
JSW
2008
167views more  JSW 2008»
15 years 16 days ago
An Approach to Discover Dependencies between Service Operations
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...
Shuying Yan, Jing Wang 0002, Chen Liu, Lei Liu
KES
2006
Springer
15 years 15 days ago
Integrated Document Browsing and Data Acquisition for Building Large Ontologies
Named entities (e.g., "Kofi Annan", "Coca-Cola", "Second World War") are ubiquitous in web pages and other types of document and often provide a simpl...
Felix Weigel, Klaus U. Schulz, Levin Brunner, Edua...
68
Voted
PAMI
2006
111views more  PAMI 2006»
15 years 15 days ago
Stereo Matching with Linear Superposition of Layers
In this paper, we address stereo matching in the presence of a class of non-Lambertian effects, where image formation can be modeled as the additive superposition of layers at diff...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski
JACM
2007
121views more  JACM 2007»
15 years 14 days ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...