Sciweavers

1395 search results - page 139 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
STACS
2010
Springer
15 years 11 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
15 years 10 months ago
Histogram Matching for Camera Pose Neighbor Selection
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
Kevin L. Steele, Parris K. Egbert, Bryan S. Morse
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 10 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
DAC
2001
ACM
16 years 5 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
WWW
2007
ACM
16 years 4 months ago
Measuring credibility of users in an e-learning environment
Learning Villages (LV) is an E-learning platform for people's online discussions and frequently citing postings of one another. In this paper, we propose a novel method to ra...
Wei Wei, Jimmy Ho-Man Lee, Irwin King