Sciweavers

2314 search results - page 251 / 463
» Minimal Partitions of a Graph
Sort
View
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 5 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
MTA
2010
175views more  MTA 2010»
15 years 2 months ago
Automatic summarization of rushes video using bipartite graphs
In this paper we present a new approach for automatic summarization of rushes video. Our approach is composed of three main steps. First, based on a temporal segmentation, we filte...
Liang Bai, Yan-Li Hu, Songyang Lao, Alan F. Smeato...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 2 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
ECCC
2011
205views ECommerce» more  ECCC 2011»
14 years 11 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
16 years 1 months ago
Generating Monitor Circuits for Simulation-Friendly GSTE Assertion Graphs
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
Kelvin Ng, Alan J. Hu, Jin Yang