Sciweavers

230 search results - page 35 / 46
» Time Varying Undirected Graphs
Sort
View
MP
2006
84views more  MP 2006»
14 years 11 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
PAMI
2006
135views more  PAMI 2006»
14 years 11 months ago
Real-Time Range Acquisition by Adaptive Structured Light
The goal of this paper is to provide a "self-adaptive" system for real-time range acquisition. Reconstructions are based on a single frame structured light illumination. ...
Thomas P. Koninckx, Luc J. Van Gool
WG
1995
Springer
15 years 2 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...
WWW
2008
ACM
16 years 13 hour ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
ASUNAM
2009
IEEE
15 years 4 months ago
Detecting Structural Changes and Command Hierarchies in Dynamic Social Networks
Community detection in social networks varying with time is a common yet challenging problem whereby efficient visualization of evolving relationships and implicit hierarchical s...
Romain Bourqui, Frédéric Gilbert, Pa...