Sciweavers

3778 search results - page 264 / 756
» Representing Web Graphs
Sort
View
AIPS
2000
15 years 8 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 6 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
15 years 6 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
COMSIS
2010
15 years 4 months ago
Multi-video summarization using complex graph clustering and mining
Multi-video summarization is a great theoretical and technical challenge due to the wider diversity of topics in multi-video than singlevideo as well as the multi-modality nature o...
Jian Shao, Dongming Jiang, Mengru Wang, Hong Chen,...
ACCV
2010
Springer
15 years 1 months ago
Linear Solvability in the Viewing Graph
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
Alessandro Rudi, Matia Pizzoli, Fiora Pirri